|
|
COMMENTS
|
The algorithm: Take n consecutive primes starting with the a(n)-th prime: {p(a(n)), ..., p(a(n)+n-1)}. Calculate the absolute differences abs(p(i)-p(j)) for all relevant pairs i,j. The number of distinct entries of this n X n difference matrix equals binomial(n,2) = n(n-1)/2, the maximum possible. Also a(n) is the earliest index such that this diversity of differences reaches the maximum possible, binomial(n,2).
The diagonal [{p(i)-p(i)}] of difference matrices consists only of zeros and can be disregarded.
The complete diversity of k-1 consecutive prime differences [as in A079007] is a necessary but not sufficient condition for providing binomial(k,2) distinct entries in the corresponding k X k difference matrix of k consecutive primes. Consecutive prime differences are para-diagonal entries in the difference matrix. So the conditions here are stronger than in A079007.
|
|
|
EXAMPLE
|
At n=1, 2, 3, the maxima are binomial(n,2) = 0, 1, 3 reached at a(n) = 1, 1, 1 respectively;
n=7: a(7)=374, primes = {p(374), ..., p(80)} = {2551, 2557, 2579, 2591, 2593, 2609, 2617}. Building the 7 X 7 matrix of values of abs(p(i)-p(j)), the number of its distinct positive entries equals binomial(7,2)=21, namely: {2, 6, 8, 12, 14, 16, 18, 22, 24, 26, 28, 30, 34, 36, 38, 40, 42, 52, 58, 60, 66};
n=12: a(12)=2332720, list of 12 primes = {p(n), ..., p(n+11)} = {38238461, ..., 38238737}; 12 X 12 matrix = {abs((p(i)-p(j))}, number of distinct entries = binomial(12,2)=66, that of {2, 6, 8, ..., 266, 274, 276}.
|
