Jumping champions and gaps between consecutive primes

Details Jumping champions and gaps between consecutive primes Jumping champions and gaps between consecutive primes

2009-10-15

arxiv.org/abs/0910.2960v3

Mathematics

Number Theory

7 pages, 1 table

Scientific paper

The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A. Odlyzko, M. Rubinstein, and M. Wolf provided heuristic and empirical evidence in support of the conjecture that the numbers greater than 1 that are jumping champions are 4 and the primorials 2, 6, 30, 210, 2310,... As a step towards proving this conjecture they introduced a second weaker conjecture that any fixed prime $p$ divides all sufficiently large jumping champions. In this paper we extend a method of P. Erd\H{o}s and E. G. Straus from 1980 to prove that the second conjecture follows directly from the prime pair conjecture of G. H. Hardy and J. E. Littlewood.

Affiliated with

Also associated with

No associations

Rating

Jumping champions and gaps between consecutive primes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Jumping champions and gaps between consecutive primes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jumping champions and gaps between consecutive primes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620646