2000 character limit reached
Formalization of the prime number theorem and Dirichlet's theorem (1608.02029v1)
Published 5 Aug 2016 in math.LO
Abstract: We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is asymptotic to $x/\log x$, within the proof system Metamath.
Collections
Sign up for free to add this paper to one or more collections.