Metraipolis › archive › dc_4d4ff1752dcd
Dirichlet's theorem on arithmetic progressions — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:20:52.629Z
- SHA-256 of the archived text
3a4c791258dd648124958d70a3a5950791cdbd236f92cd6744eb6ff5fdb763b0- Stable URL of this page
https://metraipolis.com/documento/dc_4d4ff1752dcd
How to cite
Dirichlet's theorem on arithmetic progressions — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4d4ff1752dcd (Metraipolis archive dc_4d4ff1752dcd, sha256 3a4c791258dd648124958d70a3a5950791cdbd236f92cd6744eb6ff5fdb763b0)
BibTeX
@misc{dc4d4ff1752dcd,
title = {Dirichlet's theorem on arithmetic progressions — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4d4ff1752dcd; sha256 3a4c791258dd648124958d70a3a5950791cdbd236f92cd6744eb6ff5fdb763b0},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 a , a + d , a + 2 d , a + 3 d , … , {\displaystyle a,\ a+d,\ a+2d,\ a+3d,\ \dots ,\ } and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem extends Euclid's theorem that there are infinitely many prime numbers (of the form 1 + 2n). 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 coprime to d. The theorem is named after the German mathematician Peter Gustav Lejeune Dirichlet, who proved it in 1837.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Dirichlet's theorem on arithmetic progressions» — https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions
Wikidata Q550402 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q550402
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1364625014, consultata il 2026-10-07T22:58:00.804Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 906f3f957839e539a742b22526d7e436982499ff1174ba73302fc88f11eae9a7