The primality of $R1031$
HTML articles powered by AMS MathViewer
- by H. C. Williams and Harvey Dubner PDF
- Math. Comp. 47 (1986), 703-711 Request permission
Abstract:
A description is given of a technique for proving $R1031\;( = ({10^{1031}} - 1)/9)$ a prime.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
- Richard P. Brent and John M. Pollard, Factorization of the eighth Fermat number, Math. Comp. 36 (1981), no.ย 154, 627โ630. MR 606520, DOI 10.1090/S0025-5718-1981-0606520-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
- John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman, and S. S. Wagstaff Jr., Factorizations of $b^{n}\pm 1$, Contemporary Mathematics, vol. 22, American Mathematical Society, Providence, R.I., 1983. $b=2,\,3,\,5,\,6,\,7,\,10,\,11,\,12$ up to high powers. MR 715603
- H. Cohen and H. W. Lenstra Jr., Primality testing and Jacobi sums, Math. Comp. 42 (1984), no.ย 165, 297โ330. MR 726006, DOI 10.1090/S0025-5718-1984-0726006-X
- H. Cohen and A. K. Lenstra, Implementation of a new primality test, Math. Comp. 48 (1987), no.ย 177, 103โ121, S1โS4. MR 866102, DOI 10.1090/S0025-5718-1987-0866102-2 H. Dubner & R. Dubner, "The development of a powerful, low-cost computer for number theory application," J. Recreational Math. (To appear.)
- H. W. Lenstra Jr., Divisors in residue classes, Math. Comp. 42 (1984), no.ย 165, 331โ340. MR 726007, DOI 10.1090/S0025-5718-1984-0726007-1
- 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
- H. C. Williams, A generalization of Lehmerโs functions, Acta Arith. 29 (1976), no.ย 4, 315โ341. MR 412091, DOI 10.4064/aa-29-4-315-341
- H. C. Williams, Factoring on a computer, Math. Intelligencer 6 (1984), no.ย 3, 29โ36. MR 748430, DOI 10.1007/BF03024126
- H. C. Williams and J. S. Judd, Determination of the primality of $N$ by using factors of $N^{2}\pm 1$, Math. Comp. 30 (1976), no.ย 133, 157โ172. MR 396390, DOI 10.1090/S0025-5718-1976-0396390-3
- H. C. Williams and J. S. Judd, Some algorithms for prime testing using generalized Lehmer functions, Math. Comp. 30 (1976), no.ย 136, 867โ886. MR 414473, DOI 10.1090/S0025-5718-1976-0414473-6
- H. C. Williams and R. Holte, Some observations on primality testing, Math. Comp. 32 (1978), no.ย 143, 905โ917. MR 476625, DOI 10.1090/S0025-5718-1978-0476625-0
- H. C. Williams and E. Seah, Some primes of the form $(a^{n}-1)/(a-1)$, Math. Comp. 33 (1979), no.ย 148, 1337โ1342. MR 537980, DOI 10.1090/S0025-5718-1979-0537980-7
Additional Information
- © Copyright 1986 American Mathematical Society
- Journal: Math. Comp. 47 (1986), 703-711
- MSC: Primary 11Y11; Secondary 11A51
- DOI: https://doi.org/10.1090/S0025-5718-1986-0856714-3
- MathSciNet review: 856714