: Mathematics: Dirichlet's theorem on arithmetic progressions

number > number theory > Dirichlet's theorem on arithmetic progressions

Dirichlet's theorem on arithmetic progressions

In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n is also a positive integer. In other words, there are infinitely many primes that are congruent to a modulo d. The numbers of the form a + nd form an arithmetic progression
${\\displaystyle a,\\ a+d,\\ a+2d,\\ a+3d,\\ \\dots ,\\ }$
and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem, named after Peter Gustav Lejeune Dirichlet, extends Euclid's theorem that there are infinitely many prime numbers. Stronger forms of Dirichlet's theorem state that for any such arithmetic progression, the sum of the reciprocals of the prime numbers in the progression diverges and that different such arithmetic progressions with the same modulus have approximately the same proportions of primes. Equivalently, the primes are evenly distributed (asymptotically) among the congruence classes modulo d containing a's coprime to d.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions)

http://data.loterre.fr/ark:/67375/PSR-P6H0CS8T-R

RDF/XML TURTLE JSON-LD

Loterre