DATE: Tuesday, November 24 (2009), at 3:00pm
PLACE: LIT 305
SPEAKER: Todd Molnar
|
TITLE:
|
An Easy Proof of Dirichlet's Theorem on Primes in Arithmetic Progressions
|
ABSTRACT:
Following the exposition in Ireland and Rosen's text: A
Classical Introduction to Modern Number Theory, we prove that for
any coprime integers m and n there are infinitely many primes p
such that p = mx+n, a result known as Dirichlet's Theorem. This
proof differs from other proofs of Dirichlet's theorem in that it
requires very little complex analysis, and is therefore very
accessible.
|