Factors of a Mersenne number: Difference between revisions
→{{header|Frink}}
Line 1,430:
=={{header|Frink}}==
Frink has built-in routines for iterating through prime numbers and modular exponentiation. The following program will find all of the factors of the number given enough runtime.
<lang frink>for p = primes[]
if modPow[2, 929, p] - 1 == 0
| |||