An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n . This term was coined by J. H. Conway in 1993. There are occasionally several jumping champions in a range. The scatter plots above show the jumping champions for small n, and the ranges of number having given jumping champion sets are summarized in the following table.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.