Mullin’s sequence of primes is not monotonic

Naur, Thorkil

doi:10.1090/S0002-9939-1984-0722412-X

Mullin’s sequence of primes is not monotonic
HTML articles powered by AMS MathViewer

by Thorkil Naur PDF

Proc. Amer. Math. Soc. 90 (1984), 43-44 Request permission

Abstract:

The sequence of primes defined by ${p_1} = 2$ and ${p_{n + 1}} = ({\text {largest}}\;{\text {prime}}\;{\text {factor}}\;{\text {of}}\;{p_1}\cdot {p_2} \cdots {p_n} + 1)$ is not monotone increasing. We present the first eleven primes of the sequence and observe that ${p_{10}} < {p_9}$.

References

John Brillhart, D. H. Lehmer, and J. L. Selfridge, New primality criteria and factorizations of $2^{m}\pm 1$, Math. Comp. 29 (1975), 620–647. MR 384673, DOI 10.1090/S0025-5718-1975-0384673-1
C. D. Cox and A. J. Van der Poorten, On a sequence of prime numbers, J. Austral. Math. Soc. 8 (1968), 571–574. MR 0228417, DOI 10.1017/S1446788700006236
Richard Guy and Richard Nowakowski, Discovering primes with Euclid, Delta (Waukesha) 5 (1975), no. 2, 49–63. MR 384675

On a sequence of prime numbers

70

Michael A. Morrison and John Brillhart, A method of factoring and the factorization of $F_{7}$, Math. Comp. 29 (1975), 183–205. MR 371800, DOI 10.1090/S0025-5718-1975-0371800-5

Recursive function theory

69

Integer factorization

J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76 (1974), 521–528. MR 354514, DOI 10.1017/s0305004100049252
J. M. Pollard, A Monte Carlo method for factorization, Nordisk Tidskr. Informationsbehandling (BIT) 15 (1975), no. 3, 331–334. MR 392798, DOI 10.1007/bf01933667
N. J. A. Sloane, A handbook of integer sequences, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1973. MR 0357292