View Single Post
2020-12-29, 04:43   #2
CRGreathouse

Aug 2006

176116 Posts

Quote:
 Originally Posted by ONeil Although I really wanted to find a Mersenne Prime number with 2^109947391-1, the facts are facts and it has factors other than 1 and itself. I spent a couple of weeks messing around with Pythonic code tweaking it to see if I could reveal factors. Well 2^109947391-1 starts its factors low with the number 13 and produces a monster cofactor, the cofactor I cannot put in the spoiler, because its to large.
Code:
> Mod(2,13)^109947391-1
%1 = Mod(10, 13)
Sorry, try again next time. You might want to read up on the special form of Mersenne divisors.