Quote:
|
Originally Posted by science_man_88
I know that according to resource on the divisors of Mersenne numbers of prime index that aren't prime are +1/-1 mod 8 and of the form 2kp+1 which limits possible k values depending on the exponent mod 8 . I've look at all divisors of the exceptions to 2^37-1 so far it seems if p mod 6 =5 or 1 then 2 of the factors of 2^p-1 seem to be also the same modulo 6 is this verifiable if so could this be used to further reduce the k values needed to be checked ?
|
this is from a pm I sent (bet if ever pm I sent was deleted from people's inbox's the server would run faster lol)