Modular prime-counting function

From Number
Jump to: navigation, search


Suppose is a positive real number, is a natural number, and is an integer. The modular prime-counting function for modulus and congruence class , denoted , is defined as the number of prime numbers less than or equal to , that are congruent to modulo .

This is an analogue of the prime-counting function.