Equal prime and composite sums: Difference between revisions
→{{header|jq}}: simplify
(→{{header|jq}}: simplify) |
|||
Line 60:
See [[Erdős-primes#jq]] for a suitable definition of `is_prime` as used here.
The program given in this entry requires foreknowledge of the appropriate size of the (virtual) Eratosthenes sieve.
<lang jq>def lpad($len): tostring | ($len - length) as $l | (" " * $l)[:$l] +.;▼
▲<lang jq>def lpad($len): tostring | ($len - length) as $l | (" " * $l)[:$l] +.;
def task($sievesize):
{compSums:[],
| reduce range(2; $sievesize) as $i (.;
if
then .
| .compSums += [ .csum ]
▲ .psum += $i
▲ | .primeSums += [.psum]
end)
| range(0; .primeSums|length) as $i
Line 83 ⟶ 80:
| (.compSums | index( $ps )) as $ix
| select($ix >= 0)
| "\($ps|lpad(21)) - \($i+1|lpad(21)) prime sum, \($ix+1|lpad(12)) composite sum"
;
| |||