Safe and Sophie Germain primes: Difference between revisions
Added Algol 68
Thundergnat (talk | contribs) (→{{header|Raku}}: Add a Raku example) |
(Added Algol 68) |
||
Line 8:
;Task
Generate the first '''50''' Sophie Germain prime numbers.
=={{header|ALGOL 68}}==
{{libheader|ALGOL 68-primes}}
<lang algol68>BEGIN # find some Sophie Germain primes: primes p such that 2p + 1 is prime #
PR read "primes.incl.a68" PR
[]BOOL prime = PRIMESIEVE 10 000; # hopefully, enough primes #
INT sg count := 0;
FOR p WHILE sg count < 50 DO # find the first 50 Sophie Germain primes #
IF prime[ p ] THEN
IF prime[ p + p + 1 ] THEN
print( ( " ", whole( p, -6 ) ) );
IF ( sg count +:= 1 ) MOD 12 = 0 THEN print( ( newline ) ) FI
FI
FI
OD
END</lang>
{{out}}
<pre>
2 3 5 11 23 29 41 53 83 89 113 131
173 179 191 233 239 251 281 293 359 419 431 443
491 509 593 641 653 659 683 719 743 761 809 911
953 1013 1019 1031 1049 1103 1223 1229 1289 1409 1439 1451
1481 1499
</pre>
=={{header|jq}}==
| |||