Some primes with interesting digit patterns

Williams, H. C.

doi:10.1090/S0025-5718-1978-0480311-0

Some primes with interesting digit patterns
HTML articles powered by AMS MathViewer

by H. C. Williams PDF

Math. Comp. 32 (1978), 1306-1310 Request permission

Corrigendum: Math. Comp. 39 (1982), 759.
Corrigendum: Math. Comp. 39 (1982), 759.

Abstract:

Several tables of prime numbers whose forms are generalizations of the form $({10^n} - 1)/9$ of the repunit numbers are presented. The repunit number $({10^{317}} - 1)/9$ is shown to be a prime.

References

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
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

J. Recreational Math.

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
Samuel Yates, Sylvester primes, J. Recreational Math. 8 (1975/76), no. 3, 215–217. MR 422131
Samuel Yates, Prime divisors of repunits, J. Recreational Math. 8 (1975/76), no. 1, 33–38. MR 429722