Advertisement

Ukrainian Mathematical Journal

, Volume 59, Issue 12, pp 1914–1921 | Cite as

Re-extending Chebyshev’s theorem about Bertrand’s conjecture

  • A. Shams
Brief Communications

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.

Keywords

Natural Number Prime Number Induction Assumption Extended Theorem Efficient Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Mosaheb, Elementary Number Theory, Vol. 2, Pt. 2, Soroush Press, Tehran (1980).Google Scholar
  2. 2.
    P. Ribenboim, The New Book of Prime Number Records, Springer, New York (1995).Google Scholar
  3. 3.
  4. 4.
    J. Young and A. Potler, “First occurrence of prime gaps,” Math. Comput., 53, 221–224. (1989).MathSciNetGoogle Scholar
  5. 5.
    T. Nicely, “New maximal prime gaps and first occurrence,” Math. Comput., 68, 1311–1315 (1999).zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    T. Nicely and B. Nyman, First Occurrence of a Prime Gap of 1000 or Greater, Preprint, http://www.trnicely.net/index.html.

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

  • A. Shams
    • 1
    • 2
  1. 1.The University of ManchesterManchesterUK
  2. 2.Ferdowsi University of MashhadMashhadIran

Personalised recommendations