Proof of Bertrand's Postulate for $n\ge 6$

Abstract

We add a few ideas to Erdős's proof of Bertrand's Postulate to produce one using a little calculus but requiring direct check only for $n\le 5$ and one without using calculus and requiring direct check only for $n\le 12$. The proofs can be presented to high school students.

arXiv comment6 pages, 2 references