These are the notes for the 18.784 (Number Theory Seminar) presentation I’m giving today. We prove estimates on prime-counting functions using elementary methods; in particular, that , the number of primes less than or equal to , grows “like” up to a constant multiple.
Posted by: holdenlee | October 18, 2010
Distribution of Primes
- Number Theory
- theoretical computer science
- social science