Safe and Sophie Germain primes: Difference between revisions
→{{header|Wren}}
m (→{{header|jq}}: fix wikilink) |
|||
Line 237:
1049 1103 1223 1229 1289 1409 1439 1451 1481 1499</pre>
=={{header|
<lang ring>
load "stdlib.ring"
see "working..." +nl
row = 0
limit = 1500
Sophie = []
for n = 1 to limit
p = 2*n + 1
if isprime(n) and isprime(p)
add(Sophie,n)
ok
next
see "Found " + len(Sophie) + " Safe and Sophie primes."+nl
for n = 1 to len(Sophie)
row++
see "" + Sophie[n] + " "
if row % 10 = 0
see nl
ok
next
see "done..." + nl
</lang>
{{out}}
<pre>
working...
Found 50 Safe and Sophie primes.
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
done...
</pre>
'''Bold text'''=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-seq}}
| |||