Ormiston pairs: Difference between revisions

→‎{{header|jq}}: def primeSieve:
(→‎{{header|jq}}: def primeSieve:)
Line 828:
'''Preliminaries'''
<syntaxhighlight lang=jq>
# Input: a positive integer
# Assuming . > 2, return an array, $a, of length .+1 such that
# $a[$i]Output: isan $i ifarray, $ia, isof prime,length and.+1 nullsuch otherwise.that
# $a[$i] is $i if $i is prime, and false otherwise.
def primeSieve:
# erase(i) sets .[i*j] to false for integral j > 1
def erase($i):
if .[$i] then
reduce (range(2*$i; (1 + length) /; $i)) as $j (.; .[i * $j] = nullfalse)
else .
end;
Line 892 ⟶ 893:
3722 Ormiston pairs before 10000000
</pre>
 
=={{header|Pascal}}==
==={{header|Free Pascal}}===
2,459

edits