Subscribe to the OCW Newsletter
-
-
Find Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
This is an archived course. A more recent version may be available at ocw.mit.edu.
The prime numbers (highlighted above) were identified using the Sieve of Eratosthenes. Named after the ancient Greek mathematician and scientist, Eratosthenes, it is an algorithm for identifying all prime numbers up to a given number n (in this case, up to 100). (Image by MIT OpenCourseWare.)
Prof. Kiran Kedlaya
18.785
Spring 2007
Graduate
This course is an introduction to analytic number theory, including the use of zeta functions and L-functions to prove distribution results concerning prime numbers (e.g., the prime number theorem in arithmetic progressions).
OCW has published multiple versions of this subject. 
Kiran Kedlaya. 18.785 Analytic Number Theory, Spring 2007. (Massachusetts Institute of Technology: MIT OpenCourseWare), https://ocw.mit.edu (Accessed). License: Creative Commons BY-NC-SA
For more information about using these materials and the Creative Commons license, see our Terms of Use.
Support for MIT OPENCOURSEWARE'S 15th anniversary is provided by 
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,200 courses available, OCW is delivering on the promise of open sharing of knowledge. Learn more »
© 2001–2015
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
