HEADERS_END

A Mersenne number is a number of the form EQN:M_n=2^n-1.

Mersenne numbers which are also prime are called Mersenne Primes.

Most of the largest primes known are Mersenne Primes as there exists an efficient method of testing the primality of such numbers called the Lucas-Lehmer test.

There exists an International Project to find unknown Mersenne primes called the Great Internet Mersenne Prime Search (GIMPS) where volunteers allow the down-time on their computers to be used for the endeavour.

EQN:M_p=2^p-1 is known to be prime for 47 values of p = 2, 3, 5, 7, ... ,

Enrichment Task

Show that if /n/ /(=ab)/ is a composite number

then EQN:2^a-1 is a factor of EQN:2^n-1 therefore

if EQN:2^n-1 is prime then

----

See also: Fermat prime.