Formalization of the prime number theorem and Dirichlet's theorem

Mario Carneiro

Formalization of the prime number theorem and Dirichlet's theorem

Logic 2016-08-09 v1

Authors: Mario Carneiro

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.

Keywords

prime number theorem dirichlet's theorem formalization metamath selberg's proof arithmetic progressions proof system

Cite

@article{arxiv.1608.02029,
  title  = {Formalization of the prime number theorem and Dirichlet's theorem},
  author = {Mario Carneiro},
  journal= {arXiv preprint arXiv:1608.02029},
  year   = {2016}
}

Comments

4 pages, 1 figure, published at CICM 2016, FMM track

Related papers

View all related →