Abstract
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.
References
G. Mosaheb, Elementary Number Theory, Vol. 2, Pt. 2, Soroush Press, Tehran (1980).
P. Ribenboim, The New Book of Prime Number Records, Springer, New York (1995).
C. K. Caldwell, http://www.utm.edu/research/primes/notes/GapsTable.html.
J. Young and A. Potler, “First occurrence of prime gaps,” Math. Comput., 53, 221–224. (1989).
T. Nicely, “New maximal prime gaps and first occurrence,” Math. Comput., 68, 1311–1315 (1999).
T. Nicely and B. Nyman, First Occurrence of a Prime Gap of 1000 or Greater, Preprint, http://www.trnicely.net/index.html.
Author information
Authors and Affiliations
Additional information
Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 12, pp. 1701–1706, December, 2007.
Rights and permissions
About this article
Cite this article
Shams, A. Re-extending Chebyshev’s theorem about Bertrand’s conjecture. Ukr Math J 59, 1914–1921 (2007). https://doi.org/10.1007/s11253-008-0034-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-008-0034-7