PlanetMath: Dirichlet's theorem on primes in arithmetic progressions

(more info)

Math for the people, by the people.

donor list - find out how

Main Menu

Dirichlet's theorem on primes in arithmetic progressions

(Theorem)

If $a$ is a positive integer and $(a,b)=1$ with $b$ an integer, then there are infinitely many primes of the form $an + b$ with $n$ an integer.

"Dirichlet's theorem on primes in arithmetic progressions" is owned by vitriol.

(view preamble | get metadata)

Keywords:

Dirichlet Prime

Attachments:: special case of Dirichlet's theorem on primes in arithmetic progressions (Theorem) by bbukh
there are an infinite number of primes $\equiv \pm 1\pmod 4$ (Theorem) by rm50
there are an infinite number of primes $\equiv 1\mod m$ (Theorem) by rm50
table of primes in arithmetic progressions per Dirichlet's theorem (Data Structure) by PrimeFan

Log in to rate this entry.
(view current ratings)

Cross-references: primes, integer, positive
There are 7 references to this entry.

This is version 6 of Dirichlet's theorem on primes in arithmetic progressions, born on 2002-02-16, modified 2002-05-07.
Object id is 2000, canonical name is DirichletsTheorem.
Accessed 8799 times total.

Classification:

11N13 (Number theory :: Multiplicative number theory :: Primes in progressions)

Pending Errata and Addenda

None.[ View all 2 ]

Discussion

forum policy

Interact