A Mersenne number is of the form M_n = 2 ^ n – 1. For M_n to be prime, n must be prime.
M_2 = 4 – 1 = 3 prime
M_3 = 8 – 1 = 7 prime
M_4 = 16 – 1 = 15 = 3 * 5
M_5 = 32 – 1 = 31 prime
M_6 = 64 – 1 = 63 = 7 * 9
M_7 = 128 – 1 = 127 prime
M_8 = 256 – 1 = 255 = 5 * 51 = 3 * 5 * 17 = M_4 * 17
M_9 = 512 – 1 = 511 = 7 * 73
M_10 = 1024 – 1 = 1023 = 3 * 341 = 3 * 11 * 31
M_11 = 2048 – 1 = 2047 = 23 * 89

I wrote a program to determine if a number M_p = 2 ^ p – 1 with p prime is also a Mersenne prime. I used the Lucas-Lehmer test.























































