Date of Original Version
ACM Transactions on Computational Logic 9 (1:2), 2007: 1-23.
This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
Abstract or Table of Contents
The prime number theorem, established by Hadamard and de la Vallée Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1/ln x. Whereas their proofs made serious use of the methods of complex analysis, elementary proofs were provided by Selberg and Erdos in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.