An estimate of the difference between sequences of primes (Q1084428)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3979142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An estimate of the difference between sequences of primes |
scientific article; zbMATH DE number 3979142 |
Statements
An estimate of the difference between sequences of primes (English)
0 references
1986
0 references
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.
0 references
difference between consecutive primes
0 references
fallacious proof
0 references
0.8086667656898499
0 references
0.79080730676651
0 references
0.7893940210342407
0 references