Factors of a Mersenne number: Difference between revisions
→{{header|Frink}}
Line 1,432:
Frink has built-in routines for iterating through prime numbers and modular exponentiation.
<lang frink>for p = primes[]
if modPow[2, 929, p] - 1 == 0
println[p]</lang>
{{out}}
| |||