←back to thread

359 points sdsykes | 1 comments | | HN request time: 0s | source
Show context
stevefan1999 ◴[] No.41886077[source]
But why do we have to "discover" it when we know the formula would be 2^N - 1...? Are we trying to prove a corollary or what?
replies(2): >>41886104 #>>41886109 #
aaronmdjones ◴[] No.41886104[source]
Not all 2^N - 1 are prime. For example, N=18 makes 2^N - 1 = 262143, which can also be written as 3^3 * 7 * 19 * 73 (not prime).
replies(2): >>41886111 #>>41887510 #
stevefan1999 ◴[] No.41886111[source]
Oh, right, all Mersenne number is in the form of 2^N -1, but Mersenne prime is Mersenne number plus being prime
replies(1): >>41887050 #
1. mort96 ◴[] No.41887050[source]
And we look for Mersenne primes, AFAIU, mainly because Mersenne numbers are more likely to be prime than other numbers, so it's easier to find big primes that way.