Vipul: Created page with '==Definition== Suppose $x$ is a positive real number, $n$ is a natural number, and $a$ is an integer. The '''modular prime-counting function''' ...'

2009-05-07T01:20:49Z

Created page with '==Definition== Suppose <math>x</math> is a positive real number, <math>n</math> is a natural number, and <math>a</math> is an integer. The '''modular prime-counting function''' ...'

New page

==Definition==

Suppose <math>x</math> is a positive real number, <math>n</math> is a natural number, and <math>a</math> is an integer. The '''modular prime-counting function''' for modulus <math>n</math> and congruence class <math>a</math>, denoted <math>\pi(x;n,a)</math>, is defined as the number of prime numbers less than or equal to <math>x</math>, that are congruent to <math>a</math> modulo <math>n</math>.

This is an analogue of the [[prime-counting function]].

Modular prime-counting function - Revision history

Vipul: Created page with '==Definition== Suppose x is a positive real number, n is a natural number, and a is an integer. The '''modular prime-counting function''' ...'

Vipul: Created page with '==Definition== Suppose $x$ is a positive real number, $n$ is a natural number, and $a$ is an integer. The '''modular prime-counting function''' ...'