PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (210)
Orphanage
Unclass'd (1)
Unproven (472)
Corrections (38)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very low Entry average rating: No information on entry rating
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)

View style:

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
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 6506 times total.

Classification:
AMS MSC: 11N13 (Number theory :: Multiplicative number theory :: Primes in progressions)
Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy
Link to proof by NeuRet on 2002-05-23 16:37:33
I uploaded a paper to the expositions that gives a proof of this theorem. Do you think you can refer to it in the body of your entry?

Thanks!
[ reply | up ]
Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)