ProV Logo
0

Proof of Bertrand's Postulate for $n\geq 6$
Verma, Manoj...
Proof of Bertrand's Postulate for $n\geq 6$ by Verma, Manoj ( Author )
Australian National University
01-09-2023
We add a few ideas to Erd\H{o}s's proof of Bertrand's Postulate to produce one using a little calculus but requiring direct check only for $n\leq 5$ and one without using calculus and requiring direct check only for $n\leq 12$. The proofs can be presented to high school students.
-
Article
pdf
29.34 KB
English
-
MYR 0.01
-
http://arxiv.org/abs/1401.4368
Share this eBook