Neighbour primes: Difference between revisions

(→‎{{header|jq}}: efficiency)
Line 430:
end;
# (not actually used)
def is_neighbour_prime:
is_prime and ((. * next_prime) + 2 | is_prime);
 
# The task, implemented using only `next_prime` for efficiency
# The task
{p: 2}
(2,range(3;500;2))
| while (.p < 500;
| select(is_neighbour_prime)</lang>
(.p|next_prime) as $np
| .emit = false
| if (.p * $np) + 2 | is_prime
then .emit = .p
else .
end
| .p = $np )
| select(.emit).emit
</lang>
{{out}}
<pre>
2,442

edits