Safe and Sophie Germain primes: Difference between revisions
Content added Content deleted
(Added XPL0 example.) |
|||
| Line 8: | Line 8: | ||
;Task |
;Task |
||
Generate the first '''50''' Sophie Germain prime numbers. |
Generate the first '''50''' Sophie Germain prime numbers. |
||
=={{header|jq}}== |
|||
{{works with|jq}} |
|||
'''Works with gojq, the Go implementation of jq''' |
|||
See e.g. [[#Find_adjacent_primes_which_differ_by_a_square_integer#jq]] |
|||
for suitable implementions of `is_prime/0` and `primes/0` as used here. |
|||
<lang jq>limit(50; primes | select(2*. + 1|is_prime))</lang> |
|||
{{out}} |
|||
<pre> |
|||
2 |
|||
3 |
|||
5 |
|||
... |
|||
1451 |
|||
1481 |
|||
1499 |
|||
</pre> |
|||
=={{header|XPL0}}== |
=={{header|XPL0}}== |
||