10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

1.3 <strong>Prime</strong>s of special form 23<br />

for various small primes r ≡ 1(modq)andr ≡±1 (mod 8). For the survivors,<br />

one then invokes the celebrated Lucas–Lehmer test, which is a rigorous<br />

primality test (see Section 4.2.1).<br />

As of this writing, the known Mersenne primes are those displayed in<br />

Table 1.2.<br />

2 2 − 1 2 3 − 1 2 5 − 1 2 7 − 1<br />

2 13 − 1 2 17 − 1 2 19 − 1 2 31 − 1<br />

2 61 − 1 2 89 − 1 2 107 − 1 2 127 − 1<br />

2 521 − 1 2 607 − 1 2 1279 − 1 2 2203 − 1<br />

2 2281 − 1 2 3217 − 1 2 4253 − 1 2 4423 − 1<br />

2 9869 − 1 2 9941 − 1 2 11213 − 1 2 19937 − 1<br />

2 21701 − 1 2 23209 − 1 2 44497 − 1 2 86243 − 1<br />

2 110503 − 1 2 132049 − 1 2 216091 − 1 2 756839 − 1<br />

2 859433 − 1 2 1257787 − 1 2 1398269 − 1 2 2976221 − 1<br />

2 3021377 − 1 2 6972593 − 1 2 13466917 − 1 2 20996011 − 1<br />

2 24036583 − 1 2 25964951 − 1<br />

Table 1.2 Known Mersenne primes (as of Apr 2005), ranging in size from 1 decimal<br />

digit to over 7 million decimal digits.<br />

Over the years 1979–96, D. Slowinski found seven Mersenne primes, all<br />

of the Mersenne primes from 2 44497 − 1 to 2 1257787 − 1, inclusive, except<br />

for 2 110503 − 1 (the first of the seven was found jointly with H. Nelson and<br />

the last three with P. Gage). The “missing” prime 2 110503 − 1 was found by<br />

W. Colquitt and L. Welsh, Jr., in 1988. The record for consecutive Mersenne<br />

primes is still held by R. Robinson, who found the five starting with 2 521 − 1<br />

in 1952. The prime 2 1398269 − 1 was found in 1996 by J. Armengaud and<br />

G. Woltman, while 2 2976221 −1 was found in 1997 by G. Spence and Woltman.<br />

The prime 2 3021377 − 1 was discovered in 1998 by R. Clarkson, Woltman,<br />

S. Kurowski, et al. (further verified by D. Slowinski as prime in a separate<br />

machine/program run). Then in 1999 the prime 2 6972593 − 1 was found by<br />

N. Hajratwala, Woltman, and Kurowski, then verified by E. Mayer and<br />

D. Willmore. The case 2 13466917 − 1 was discovered in November 2001 by<br />

M. Cameron, Woltman, and Kurowski, then verified by Mayer, P. Novarese,<br />

and G. Valor. In November 2003, M. Shafer, Woltman, and Kurowski found<br />

2 20996011 − 1. The Mersenne prime 2 24036583 − 1 was found in May 2004 by<br />

J. Findley, Woltman, and Kurowski. Then in Feb 2005, M. Nowak, Woltman<br />

and Kurowski found 2 25964951 −1. Each of these last two Mersenne primes has<br />

more than 7 million decimal digits.<br />

The eight largest known Mersenne primes were found using a fast<br />

multiplication method—the IBDWT—discussed in Chapter 8.8 (Theorem

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!