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...
Saved in:
| Date: | 2007 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2007
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/3424 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |
Institution
Ukrains’kyi Matematychnyi Zhurnal| Summary: | 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. |
|---|