Lucas-Lehmer test: Difference between revisions
Content deleted Content added
→{{header|F Sharp|F#}}: added version based on folding |
Catskill549 (talk | contribs) |
||
Line 115:
</pre>
See also: http://www.xs4all.nl/~jmvdveer/mersenne.a68.html
=={{header|AWK}}==
<lang AWK>
# syntax: GAWK -f LUCAS-LEHMER_TEST.AWK
# converted from Pascal
BEGIN {
printf("Mersenne primes:")
n = 1
for (exponent=2; exponent<=32; exponent++) {
s = (exponent == 2) ? 0 : 4
n = (n+1)*2-1
for (i=1; i<=exponent-2; i++) {
s = (s*s-2)%n
}
if (s == 0) {
printf(" M%s",exponent)
}
}
printf("\n")
exit(0)
}
</lang>
<p>output:</p>
<pre>
Mersenne primes: M2 M3 M5 M7 M13 M17 M19
</pre>
=={{header|BBC BASIC}}==
{{works with|BBC BASIC for Windows}}
| |||