Mathematics of Computation

			Journals Home Search Author Info Subscribe Tech Support Help
ISSN 1088-6842(e) ISSN 0025-5718(p)

Previous issue \| Table of contents \| Next issue Articles in press \| Recently posted articles \| Most recent issue \| All issues Previous Article \| Next Article

A large pair of twin primes

Author(s): Tony Forbes.
Journal: Math. Comp. 66 (1997), 451-455.
MSC (1991): Primary 11A41; Secondary 11A51
Retrieve article in: PDF DVI PostScript
This article is available free of charge

Abstract | References | Similar articles | Additional information

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:

1.: Tony Forbes, Prime k-tuplets, M500 146 (1995), 8-12.
2.: J. 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 52:5546
3.: A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1975. MR 54:1706
4.: C. K. Caldwell, UBASIC, J. Recreational Math. 25 (1993), 47-54.
5.: 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.


	Comments: webmaster@ams.org © Copyright 2008, American Mathematical Society Privacy Statement		Search the AMS