Palindromic primes: Difference between revisions

(→‎{{header|jq}}: (corrected))
Line 287:
In this entry, we define both a naive generate-and-test generator of the palindromic primes,
and a more sophisticated one that is well-suited for generating very large numbers of such primes,
as illustrated by counting the number less than 10^910.
 
For a suitable implementation of `is_prime` as used here, see [[Erd%C5%91s-primes#jq]].
Line 328:
end;
# palindromes with an even number of digits are divisible by 11
range(1;infinite) as $mid
 
range(1;infinite;2) as $mid
| ("1", "3", "7", "9") as $start
| $start + middle($mid) + $start ;
Line 373 ⟶ 375:
 
Number of palindromic primes <= 1000000000: 5953
</pre>
 
Number of palindromic primes <= 10000000000: 5953
</pre>
 
=={{header|Julia}}==
2,442

edits