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
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:
“Vanessa wanted to be a ballerina. Dad had such hopes for her.... Corin was the academically brilliant one, and a fencer of Olympic standard. Everything was expected of them, and they fulfilled all expectations. But I was the one of whom nothing was expected. I remember a game the three of us played. Vanessa was the President of the United States, Corin was the British Prime Minister—and I was the royal dog.”
—Lynn Redgrave (b. 1943)
“Envy has blackened every page of his history.... The future, in its justice, will number him among those men whom passions and an excess of activity have condemned to unhappiness, through the gift of genius.”
—Eugène Delacroix (1798–1863)
“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)
“I hope I may claim in the present work to have made it probable that the laws of arithmetic are analytic judgments and consequently a priori. Arithmetic thus becomes simply a development of logic, and every proposition of arithmetic a law of logic, albeit a derivative one. To apply arithmetic in the physical sciences is to bring logic to bear on observed facts; calculation becomes deduction.”
—Gottlob Frege (1848–1925)