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:
“Being prime minister is a lonely job.... you cannot lead from the crowd.”
—Margaret Thatcher (b. 1925)
“The rising power of the United States in world affairs ... requires, not a more compliant press, but a relentless barrage of facts and criticism.... Our job in this age, as I see it, is not to serve as cheerleaders for our side in the present world struggle but to help the largest possible number of people to see the realities of the changing and convulsive world in which American policy must operate.”
—James Reston (b. 1909)
“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)
“Under the dominion of an idea, which possesses the minds of multitudes, as civil freedom, or the religious sentiment, the power of persons are no longer subjects of calculation. A nation of men unanimously bent on freedom, or conquest, can easily confound the arithmetic of statists, and achieve extravagant actions, out of all proportion to their means; as, the Greeks, the Saracens, the Swiss, the Americans, and the French have done.”
—Ralph Waldo Emerson (1803–1882)