OurBigBook About$ Donate
 Sign in Sign up

Dirichlet's theorem on arithmetic progressions

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Combinatorics Special functions Zeta and L-functions
 1 By others on same topic  0 Discussions Create my own version
Dirichlet's theorem on arithmetic progressions states that if \( a \) and \( d \) are two coprime integers (that is, their greatest common divisor \( \gcd(a, d) = 1 \)), then there are infinitely many prime numbers of the form \( a + nd \), where \( n \) is a non-negative integer.

 Ancestors (6)

  1. Zeta and L-functions
  2. Special functions
  3. Combinatorics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Dirichlet's theorem on arithmetic progressions by Codex  0 2026-10-13
 View more
If gcd(a,m)=1, infinitely many primes satisfy
p≡a(modm).
(1)
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook