We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand's postulate. Even if Chebyshev's result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions psi and theta still play a central role in the modern development of number theory. The proof makes use of most part of the machinery of elementary arithmetics, and in particular of properties of prime numbers, gcd, products and summations, providing a natural benchmark for assessing the actual development of the arithmetical knowledge base.
@article{3406,
title = {A proof of Bertrand's postulate},
journal = {Journal of Formalized Reasoning},
volume = {5},
year = {2012},
doi = {10.6092/issn.1972-5787/3406},
language = {EN},
url = {http://dml.mathdoc.fr/item/3406}
}
Asperti, Andrea; Ricciotti, Wilmer. A proof of Bertrand's postulate. Journal of Formalized Reasoning, Tome 5 (2012) . doi : 10.6092/issn.1972-5787/3406. http://gdmltest.u-ga.fr/item/3406/