A large pair of twin primes
HTML articles powered by AMS MathViewer
- by Tony Forbes PDF
- Math. Comp. 66 (1997), 451-455 Request permission
Abstract:
We describe an efficient integer squaring algorithm (involving the fast Fourier transform modulo $F_8)$ that was used on a 486 computer to discover a large pair of twin primes.References
- Tony Forbes, Prime k-tuplets$-10$, M500 146 (1995), 8–12.
- 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
- Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Second printing. MR 0413592
- C. K. Caldwell, UBASIC, J. Recreational Math. 25 (1993), 47–54.
- G. H. Hardy and J. E. Littlewood, Some problems of ‘Partitio Numerorum’; III: On the expression of a number as a sum of primes, Acta Math. 44 (1922), 1–70.
Additional Information
- Tony Forbes
- Affiliation: 22 St. Albans Road, Kingston upon Thames, Surrey, KT2 5HQ, England
- Email: tonyforbes@ltkz.demon.co.uk
- Received by editor(s): October 9, 1995
- Received by editor(s) in revised form: December 6, 1995, and January 26, 1996
- © Copyright 1997 American Mathematical Society
- Journal: Math. Comp. 66 (1997), 451-455
- MSC (1991): Primary 11A41; Secondary 11A51
- DOI: https://doi.org/10.1090/S0025-5718-97-00793-X
- MathSciNet review: 1372004