Re-extending Chebyshev’s theorem about Bertrand’s conjecture
- A. Shams
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- Mosaheb, G. (1980) Elementary Number Theory. Soroush Press, Tehran
- Ribenboim, P. (1995) The New Book of Prime Number Records. Springer, New York
- C. K. Caldwell, http://www.utm.edu/research/primes/notes/GapsTable.html.
- Young, J., Potler, A. (1989) First occurrence of prime gaps. Math. Comput. 53: pp. 221-224.
- Nicely, T. (1999) New maximal prime gaps and first occurrence. Math. Comput. 68: pp. 1311-1315 CrossRef
- T. Nicely and B. Nyman, First Occurrence of a Prime Gap of 1000 or Greater, Preprint, http://www.trnicely.net/index.html.
- Re-extending Chebyshev’s theorem about Bertrand’s conjecture
Ukrainian Mathematical Journal
Volume 59, Issue 12 , pp 1914-1921
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- A. Shams (1) (2)
- Author Affiliations
- 1. The University of Manchester, Manchester, UK
- 2. Ferdowsi University of Mashhad, Mashhad, Iran