An Elementary proof for Bertrand's Postulate
Pranav Narayan Sharma
TL;DR
This paper presents an elementary proof of Bertrand's postulate, which states that for every integer n greater than 1, there is at least one prime p such that n < p < 2n.
Contribution
The paper provides a new elementary proof of Bertrand's postulate, simplifying previous proofs and making the theorem more accessible.
Findings
Elementary proof of Bertrand's postulate
Simplifies understanding of prime distribution
Accessible proof for educational purposes
Abstract
In this paper we give an elementary proof for Bertrand's postulate also known as Bertrand-Chebyshev theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistorical Studies and Socio-cultural Analysis · History and Theory of Mathematics