Some factorizations of $10^{n}\pm 1$
HTML articles powered by AMS MathViewer
- by I. O. Angell and H. J. Godwin PDF
- Math. Comp. 28 (1974), 307-308 Request permission
Abstract:
Factorizations of ${10^n} + 1$ and/or ${10^n} - 1$ are given for a number of values of n.References
- Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969. MR 0286318
- D. H. Lehmer, Tests for primality by the converse of Fermat’s theorem, Bull. Amer. Math. Soc. 33 (1927), no. 3, 327–340. MR 1561374, DOI 10.1090/S0002-9904-1927-04368-3 R. Ondrejka, Recreational Math. Mag., Feb. 1962, p. 47.
- Hans Riesel, En bok om primtal, Studentlitteratur, Lund, 1968 (Swedish). MR 0269612
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Math. Comp. 28 (1974), 307-308
- MSC: Primary 10A25
- DOI: https://doi.org/10.1090/S0025-5718-1974-0330027-2
- MathSciNet review: 0330027