The prime difference function is the difference between consecutive primes,
(1)
where
is the th
prime and is a positive integer.
The first few values are 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, ... (OEIS
A001223). Rankin has shown that
(2)
for infinitely many and for some positive constant (Guy 1994). At a March 2003 meeting on elementary and analytic
number in Oberwolfach, Germany, Goldston and Yildirim presented an attempted proof
that
(3)
(Montgomery 2003). Unfortunately, this proof turned out to be flawed. The equality
was subsequently proved unconditionally by Goldston et al. (2009, p. 819).
A positive integer is a jumping champion
if it is a most frequently occurring difference between consecutive primes
not exceeding some bound (Odlyzko et al. 1999).