Primes of the form 𝑛!±1 and 2⋅3⋅5⋯𝑝±1

Buhler, J. P.; Crandall, R. E.; Penk, M. A.

doi:10.1090/S0025-5718-1982-0645679-1

Primes of the form $n!\pm 1$ and $2\cdot 3\cdot 5\cdots p\pm 1$
HTML articles powered by AMS MathViewer

by J. P. Buhler, R. E. Crandall and M. A. Penk PDF

Math. Comp. 38 (1982), 639-643 Request permission

Corrigendum: Math. Comp. 40 (1983), 727.
Corrigendum: Math. Comp. 40 (1983), 727.

Abstract:

All primes less than ${10^{1000}}$ of the form $n! \pm 1$ or $2 \cdot 3 \cdot 5 \cdots p \pm 1$ are determined. Results of Brillhart, Lehmer, and Selfridge are used together with a fast algorithm that applies to primality tests of integers N for which many factors of $N \pm 1$ are known.

References

Leonard M. Adleman, Carl Pomerance, and Robert S. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. (2) 117 (1983), no. 1, 173–206. MR 683806, DOI 10.2307/2006975
Alan Borning, Some results for $k\,!\pm 1$ and $2\cdot 3\cdot 5\cdots p\pm 1$, Math. Comp. 26 (1972), 567–570. MR 308018, DOI 10.1090/S0025-5718-1972-0308018-5
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
Gary L. Miller, Riemann’s hypothesis and tests for primality, J. Comput. System Sci. 13 (1976), no. 3, 300–317. MR 480295, DOI 10.1016/S0022-0000(76)80043-8
Mark Templer, On the primality of $k!+1$ and $2\ast 3$ $\ast 5\ast \cdots \ast \,p+1$, Math. Comp. 34 (1980), no. 149, 303–304. MR 551306, DOI 10.1090/S0025-5718-1980-0551306-2