Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

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

J. Recreational Math.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y11, 11A51
Retrieve articles in all journals with MSC: 11Y11, 11A51

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