Computer Science – Artificial Intelligence
Scientific paper
2005-09-09
Computer Science
Artificial Intelligence
23 pages
Scientific paper
The prime number theorem, established by Hadamard and de la Vall'ee 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 Erd"os in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.
Avigad Jeremy
Donnelly Kevin
Gray David
Raff Paul
No associations
LandOfFree
A formally verified proof of the prime number theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A formally verified proof of the prime number theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A formally verified proof of the prime number theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-464179