Some results for 𝑘!±1 and 2⋅3⋅5⋯𝑝±1

Borning, Alan

doi:10.1090/S0025-5718-1972-0308018-5

Some results for $k !\pm 1$ and $2\cdot 3\cdot 5\cdots p\pm 1$
HTML articles powered by AMS MathViewer

by Alan Borning PDF

Math. Comp. 26 (1972), 567-570 Request permission

Abstract:

The numbers $k! \pm 1$ for $k = 2(1)100$, and $2 \cdot 3 \cdot 5 \cdots p \pm 1$ for $p$ prime, $2 \leqq p \leqq 307$, were tested for primality. For $k = 2(1)30$, factorizations of $k! \pm 1$ are given.

References

D. H. Lehmer, Computer technology applied to the theory of numbers, Studies in Number Theory, Math. Assoc. America, Buffalo, N.Y.; distributed by Prentice-Hall, Englewood Cliffs, N.J., 1969, pp. 117–151. MR 0246815

Elementary Theory of Numbers

13

22

31

M. Kraitchik, Introduction à la théorie des nombres, Gauthier-Villars, Paris, 1952 (French). MR 0051845
John Brillhart and J. L. Selfridge, Some factorizations of $2^{n}\pm 1$ and related results, Math. Comp. 21 (1967), 87-96; corrigendum, ibid. 21 (1967), 751. MR 0224532, DOI 10.1090/S0025-5718-1967-0224532-3
Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms. MR 633878