Anonymous user
Factors of a Mersenne number: Difference between revisions
→{{header|Crystal}}
Line 880:
def mersenne_factor(p)
while (
q =
if prime?(q) && [1, 7].includes?(q % 8) && (powmod(2, p, q) == 1)
# q is a factor of 2**p-1
return q
end
end
true # could also set to `0` value to check for
| |||