Anonymous user
Factors of a Mersenne number: Difference between revisions
→{{header|Crystal}}
Line 884:
while (kp2 - 1) ** 2 < mers_num
q = kp2 + 1
return q if prime?(q) && [1, 7].includes?(q % 8) && (powmod(2, p, q) == 1)
kp2 += p2
end
| |||