scientific article; zbMATH DE number 3879000
It is well known that the number 30 is the largest natural number n with the property that the positive integers \(\leq n\) and relatively prime to n are all primes, apart from 1. Generalizing this theorem of Bonse's, the author gives a proof, based on the Prime Number Theorem, for the fact that the set of positive integers n such that all the integers r with \(1<r\leq n\), \((r,n)=1\), and V(r)\(\leq \ell\), is finite for every \(\ell \geq 1\), where V(r) denotes the total number of prime factors of the integer r. The reviewer remarks that this result can be found as an exercise in \textit{H. N. Shapiro} [Introduction to the theory of numbers (1983; Zbl 0515.10001), p. 81] where the possibility of giving a more elementary proof is indicated.
- scientific article; zbMATH DE number 4134126 (Why is no real title available?)
- scientific article; zbMATH DE number 1260832 (Why is no real title available?)
- On the product of continuous prime numbers
- Schatunowsky's theorem, Bonse's inequality, and Chebyshev's theorem in weak fragments of Peano arithmetic
- scientific article; zbMATH DE number 3303246 (Why is no real title available?)
- A Generalization of Schatunowsky’s Theorem
- Bonse's inequality along subsequences of primes
- Schatunowsky-type theorems for imaginary quadratic integer rings of class number one
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344043)