An estimate of the difference between sequences of primes
From MaRDI portal
Let \(p_n\) denote the \(n\)-th prime. The author claims to have proved \[ \sqrt{p_{n+1}}-\sqrt{p_n}=o(1) \text{ as } n\to \infty, \tag{1}\] but when one analyzes his ``proof, it is seen that he uses \((2)\ p_{n+1}- p_ n\ll \log^{\alpha} p_ n\) (for some suitable, fixed \(\alpha >2)\), and (2) is much stronger than (1) and to this day unproved. A fallacious proof of the famous conjecture ``Between any two squares there is always a prime is also included.
Recommendations
Cited in
(5)
This page was built for publication: An estimate of the difference between sequences of primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084428)