Jump to content

Mersenne primes: Difference between revisions

m
reorder
(add PicoLisp)
m (reorder)
Line 1,100:
2 ^ 31 - 1
2 ^ 61 - 1</pre>
 
=={{header|Pike}}==
<lang Pike>int power = 1;
while(power++) {
int candidate = 2->pow(power)-1;
if( candidate->probably_prime_p() )
write("2 ^ %d - 1\n", power);
}</lang>
Output:
<pre>
2 ^ 2 - 1
2 ^ 3 - 1
2 ^ 5 - 1
2 ^ 7 - 1
2 ^ 13 - 1
2 ^ 17 - 1
2 ^ 19 - 1
2 ^ 31 - 1
2 ^ 61 - 1
</pre>
 
=={{header|PicoLisp}}==
Line 1,178 ⟶ 1,158:
2 ^ 521 - 1
2 ^ 607 - 1
</pre>
 
=={{header|Pike}}==
<lang Pike>int power = 1;
while(power++) {
int candidate = 2->pow(power)-1;
if( candidate->probably_prime_p() )
write("2 ^ %d - 1\n", power);
}</lang>
Output:
<pre>
2 ^ 2 - 1
2 ^ 3 - 1
2 ^ 5 - 1
2 ^ 7 - 1
2 ^ 13 - 1
2 ^ 17 - 1
2 ^ 19 - 1
2 ^ 31 - 1
2 ^ 61 - 1
</pre>
 
298

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.