Schatunowsky's theorem, Bonse's inequality, and Chebyshev's theorem in weak fragments of Peano arithmetic

Mathematical Logic Quarterly 61 (3):230-235 (2015)
  Copy   BIBTEX

Abstract

In 1893, Schatunowsky showed that 30 is the largest number all of whose totatives are primes; we show that this result cannot be proved, in any form, in Chebyshev's theorem (Bertrand's postulate), even if all irreducibles are primes. Bonse's inequality is shown to be indeed weaker than Chebyshev's theorem. Schatunowsky's theorem holds in together with Bonse's inequality, the existence of the greatest prime dividing certain types of numbers, and the condition that all irreducibles be prime.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2015-09-03

Downloads
28 (#806,304)

6 months
7 (#730,543)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references