# Mills' prime

In the late forties Mills proved [Mills47] that:

Mills' Theorem: there is a real number A for which [] is always a prime (n = 1,2,3,...).

The key to finding a value for A is that we need to construct a sequence of primes (Mills' primes) p1, p2, ...; for which pi-1 is between pi3 and (pi+1)3.  The constant A is then the limit of pn3-n as n approaches infinity.

Mills' one page article contained no numerics, it only proved the existence of A.  Others [Wright1954] later proved that there are uncountably many choices for A, but again gave no value for A. In fact, we can only prove there are primes between consecutive cubes if we are looking at numbers beyond 106000000000000000000 [Cheng2003a].

If we assume the Riemann Hypothesis, then it is easy to show there are primes between consecutive cubes of integers [CC2005] greater than one; and then we can calculate example to our hearts content.  Following tradition (and definitley not following Mills) we begin our sequence of primes as follows:

b1 = 2,
b2 = 11,
b3 = 1361,
b4 = 2521008887,
b5 = 160222362 0400981813 1831320183,
b6 = 41131 0114921510 4800030529 5379159531 7048613962 3539759933 1359499948 8277040407 4832568499

These are called the Mills Primes.  This sequence is formed by choosing the minimal prime at each step, and yields the smallest possible value for Mills' constant:

1.30637788386308069046861449260260571291678...

A few more Mills primes are known.  To make them easier to present, let bn+1 = bn3+an.  The sequence an begins:

3, 30, 6, 80, 12, 450, 894, 3636, 70756, 97220 (bn prp), 66768 (bn prp)

The primality of b7, b8, and b9 (2285 digits) were proved byBouk de Water in 2000; and Morain proved b9 (6854 digits) prime in 2005. Carmody found the two PRP's (20562 and 61684 digits) in 2004.