Iterated absolute values of differences of consecutive primes

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


Let dç, (n) = p„, the nth prime, for n > 1, and let dk+x(n) = \dk(n) - dk(n + 1) for k > 0, n > 1. A well-known conjecture, usually ascribed to Gilbreath but actually due to Proth in the 19th century, says that dk(\) = 1 for all k > 1. This paper reports on a computation that verified this conjecture for k < tt(1013) » 3 x 10". 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.

Original languageEnglish (US)
Pages (from-to)373-380
Number of pages8
JournalMathematics of Computation
Issue number203
StatePublished - Jul 1993


Dive into the research topics of 'Iterated absolute values of differences of consecutive primes'. Together they form a unique fingerprint.

Cite this