Re-extending Chebyshev’s theorem about Bertrand’s conjecture
In this paper, Chebyshev’s theorem (1850) about Bertrand’s conjecture is re-extended using a theorem about Sierpinski’s conjecture (1958). The theorem had been extended before several times, but this extension is a major extension far beyond the previous ones. At the beginning of the proof, maximal gaps table is used to verify initial states. The extended theorem contains a constant r, which can be reduced if more initial states can be checked. Therefore, the theorem can be even more extended when maximal gaps table is extended. The main extension idea is not based on r, though.
KeywordsNatural Number Prime Number Induction Assumption Extended Theorem Efficient Program
Unable to display preview. Download preview PDF.
- 1.G. Mosaheb, Elementary Number Theory, Vol. 2, Pt. 2, Soroush Press, Tehran (1980).Google Scholar
- 2.P. Ribenboim, The New Book of Prime Number Records, Springer, New York (1995).Google Scholar
- 3.C. K. Caldwell, http://www.utm.edu/research/primes/notes/GapsTable.html.
- 6.T. Nicely and B. Nyman, First Occurrence of a Prime Gap of 1000 or Greater, Preprint, http://www.trnicely.net/index.html.