# Euclid–Mullin sequence

The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements. They are named after the ancient Greek mathematician Euclid, because their definition relies on an idea in Euclid's proof that there are infinitely many primes, and after Albert A. Mullin, who asked about the sequence in 1963.[1]

The first 51 elements of the sequence are

2, 3, 7, 43, 13, 53, 5, 6221671, 38709183810571, 139, 2801, 11, 17, 5471, 52662739, 23003, 30693651606209, 37, 1741, 1313797957, 887, 71, 7127, 109, 23, 97, 159227, 643679794963466223081509857, 103, 1079990819, 9539, 3143065813, 29, 3847, 89, 19, 577, 223, 139703, 457, 9649, 61, 4357, 87991098722552272708281251793312351581099392851768893748012603709343, 107, 127, 3313, 227432689108589532754984915075774848386671439568260420754414940780761245893, 59, 31, 211... (sequence A000945 in the OEIS)

These are the only known elements as of September 2012. Finding the next one requires finding the least prime factor of a 335-digit number (which is known to be composite).

## Definition

The ${\displaystyle n}$th element of the sequence, ${\displaystyle a_{n}}$, is the least prime factor of

${\displaystyle {\Bigl (}\prod _{i

The first element is therefore the least prime factor of the empty product plus one, which is 2. The element 13 in the sequence is the least prime factor of 2 × 3 × 7 × 43 + 1 = 1806 + 1 = 1807 = 13 × 139.

## Properties

The sequence is infinitely long and does not contain repeated elements. This can be proved using the method of Euclid's proof that there are infinitely many primes. That proof is constructive, and the sequence is the result of performing a version of that construction.

## Conjecture

 Unsolved problem in mathematics:Does every prime number appear in the Euclid–Mullin sequence?(more unsolved problems in mathematics)

Mullin (1963) asked whether every prime number appears in the Euclid–Mullin sequence and, if not, whether the problem of testing a given prime for membership in the sequence is computable. Daniel Shanks (1991) conjectured, on the basis of heuristic assumptions that the distribution of primes is random, that every prime does appear in the sequence.[2] However, although similar recursive sequences over other domains do not contain all primes,[3] these problems both remain open for the original Euclid–Mullin sequence.[4] The least prime number not known to be an element of the sequence is 41.

The positions of the prime numbers from 2 to 97 are:

2:1, 3:2, 5:7, 7:3, 11:12, 13:5, 17:13, 19:36, 23:25, 29:33, 31:50, 37:18, 41:?, 43:4, 47:?, 53:6, 59:49, 61:42, 67:?, 71:22, 73:?, 79:?, 83:?, 89:35, 97:26 (sequence A056756 in the OEIS)

where ? indicates that the position (or whether it exists at all) is unknown as of 2012.[5]

## Related sequences

A related sequence of numbers determined by the largest prime factor of one plus the product of the previous numbers (rather than the smallest prime factor) is also known as the Euclid–Mullin sequence. It grows more quickly, but is not monotonic.[6] The numbers in this sequence are

2, 3, 7, 43, 139, 50207, 340999, 2365347734339, 4680225641471129, 1368845206580129, 889340324577880670089824574922371, … (sequence A000946 in the OEIS).

Not every prime number appears in this sequence,[7] and the sequence of missing primes,

5, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 61, 67, 71, 73, ... (sequence A216227 in the OEIS)

has been proven to be infinite.[8][9]

It is also possible to generate modified versions of the Euclid–Mullin sequence by using the same rule of choosing the smallest prime factor at each step, but beginning with a different prime than 2.[10]

Alternatively, taking each number to be one plus the product of the previous numbers (rather than factoring it) gives Sylvester's sequence. The sequence constructed by repeatedly appending all factors of one plus the product of the previous numbers is the same as the sequence of prime factors of Sylvester's sequence. Like the Euclid–Mullin sequence, this is a non-monotonic sequence of primes, but it is known not to include all primes.[11]

## References

1. ^ Mullin, Albert A. (1963), "Recursive function theory (A modern look at a Euclidean idea)", Research problems, Bulletin of the American Mathematical Society, 69 (6): 737, doi:10.1090/S0002-9904-1963-11017-4.
2. ^ Shanks, Daniel (1991), "Euclid's primes", Bulletin of the Institute of Combinatorics and its Applications, 1: 33–36, MR 1103634.
3. ^ Kurokawa, Nobushige; Satoh, Takakazu (2008), "Euclid prime sequences over unique factorization domains", Experimental Mathematics, 17 (2): 145–152, MR 2433881.
4. ^ Booker, Andrew R. (2016), "A variant of the Euclid-Mullin sequence containing every prime", Journal of Integer Sequences, 19 (6): Article 16.6.4, 6, MR 3546618.
5. ^ The listing with the question marks is given in the Extensions field of the OEIS entry, whereas the main listing stops at 33 and has no question marks.
6. ^ Naur, Thorkil (1984), "Mullin's sequence of primes is not monotonic", Proceedings of the American Mathematical Society, 90 (1): 43–44, doi:10.2307/2044665, MR 0722412.
7. ^ Cox, C. D.; Van der Poorten, A. J. (1968), "On a sequence of prime numbers", Australian Mathematical Society, 8: 571–574, MR 0228417
8. ^ Booker, Andrew R. (2012), "On Mullin's second sequence of primes", Integers, 12 (6): 1167–1177, arXiv:, doi:10.1515/integers-2012-0034, MR 3011555.
9. ^ Pollack, Paul; Treviño, Enrique (2014), "The primes that Euclid forgot", American Mathematical Monthly, 121 (5): 433–437, doi:10.4169/amer.math.monthly.121.05.433, MR 3193727.
10. ^ Sheppard, Barnaby (2014), The Logic of Infinity, Cambridge University Press, p. 26, ISBN 9781139952774
11. ^ Guy, Richard; Nowakowski, Richard (1975), "Discovering primes with Euclid", Delta (Waukesha), 5 (2): 49–63, MR 0384675.