Anonymous user
Factors of a Mersenne number: Difference between revisions
→{{header|Crystal}}
Line 884:
while (k * 2 * p - 1) ** 2 < mp_num
q = k * 2 * p + 1
if prime?(q) &&
# q is a factor of 2**p-1
return q
| |||
Line 884:
while (k * 2 * p - 1) ** 2 < mp_num
q = k * 2 * p + 1
if prime?(q) &&
# q is a factor of 2**p-1
return q
| |||