Prime Number Theorem - Prime Number Theorem For Arithmetic Progressions

Prime Number Theorem For Arithmetic Progressions

Let denote the number of primes in the arithmetic progression a, a + n, a + 2n, a + 3n, … less than x. Dirichlet and Legendre conjectured, and Vallée-Poussin proved, that, if a and n are coprime, then

\pi_{n,a}(x) \sim \frac{1}{\phi(n)}\mathrm{Li}(x),

where φ(·) is the Euler's totient function. In other words, the primes are distributed evenly among the residue classes modulo n with gcd(a, n) = 1. This can be proved using similar methods used by Newman for his proof of the prime number theorem.

The Siegel–Walfisz theorem gives a good estimate for the distribution of primes in residue classes.

Read more about this topic:  Prime Number Theorem

Famous quotes containing the words prime, number, theorem and/or arithmetic:

    “My prime of youth is but a frost of cares,
    My feast of joy is but a dish of pain,
    My crop of corn is but a field of tares,
    And all my good is but vain hope of gain:
    The day is past, and yet I saw no sun,
    And now I live, and now my life is done.”
    —Chidiock Tichborne (1558–1586)

    “I who have been involved with all styles of painting can assure you that the only things that fluctuate are the waves of fashion which carry the snobs and speculators; the number of true connoisseurs remains more or less the same.”
    —Pablo Picasso (1881–1973)

    “To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
    —Albert Camus (1913–1960)

    “O! O! another stroke! that makes the third.
    He stabs me to the heart against my wish.
    If that be so, thy state of health is poor;
    But thine arithmetic is quite correct.”
    —A.E. (Alfred Edward)