Mersenne divisor

Mersenne primes have always been the most sought after primes ever since Euclid connected them to perfect numbers over two millennia ago. When searching for new Mersennes, you first look for small divisors (called Mersenne divisors), then apply the Lucas-Lehmer test. These divisors must have a very special form because Fermat and Euler proved:

Theorem:

Let p and q be odd primes. If p divides M_q, then p = 1 (mod q) and p = +/-1 (mod 8).

(The proof is linked below.) Sometimes, just the fact that a number divides a Mersenne is enough to show it is prime:

Theorem.

Let p ≡ 3 (mod 4) be prime. 2p+1 is also prime if and only if 2p+1 divides M_p.

(The proof is also linked below.)

See Also: Mersennes, CunninghamProject

Related pages (outside of this work)

• Modular restrictions on Mersenne divisors (proof and example of the first theorem above)
• A result of Euler and Lagrange on Mersenne Divisors (proof and example of the second theorem above)
• Prime-square Mersenne divisors are Wieferich primes