vix.ing · top · new · best · stats · spec

Proof of Bertrand's Postulate for n≥ 6

2013/12/31 by Manoj Verma, Verma, Manoj
Mathematics · #11A41 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11A41

paper · pdf · doi:10.48550/arxiv.1401.4368

6 pages, 2 references

arxiv created 2018/03/21 · arxiv updated 2018/03/22

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≤ 5 and one without using calculus and requiring direct check only for n≤ 12. The proofs can be presented to high school students.

Related