Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Iterated absolute values of differences of consecutive primes


Author: Andrew M. Odlyzko
Journal: Math. Comp. 61 (1993), 373-380
MSC: Primary 11Y35; Secondary 11N05
MathSciNet review: 1182247
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ {d_0}(n) = {p_n}$, the nth prime, for $ n \geq 1$, and let $ {d_{k + 1}}(n) = \vert{d_k}(n) - {d_k}(n + 1)\vert$ for $ k \geq 0,n \geq 1$. A well-known conjecture, usually ascribed to Gilbreath but actually due to Proth in the 19th century, says that $ {d_k}(1) = 1$ for all $ k \geq 1$. This paper reports on a computation that verified this conjecture for $ k \leq \pi ({10^{13}}) \approx 3 \times {10^{11}}$. It also discusses the evidence and the heuristics about this conjecture. It is very likely that similar conjectures are also valid for many other integer sequences.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y35, 11N05

Retrieve articles in all journals with MSC: 11Y35, 11N05


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1993-1182247-7
PII: S 0025-5718(1993)1182247-7
Article copyright: © Copyright 1993 American Mathematical Society