composite runs

A prime gap of length n is a run of n - 1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k + 1) bounding a prime gap of length n is p_(k + 1) - p_k = n, where p_k is the kth prime number. Since the prime difference function d_k congruent p_(k + 1) - p_k

Cramér-Granville conjecture | jumping champion | nearest prime | prime constellation | prime difference function | prime distance | Shanks' conjecture | twin composites | twin primes