Jump to content

Palindromic primes: Difference between revisions

Line 286:
 
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 1000 million (10^9).
 
For a suitable implementation of `is_prime` as used here, see [[Erd%C5%91s-primes#jq]].
Line 337 ⟶ 336:
emit_until(. >= 1000; palindromic_primes),
 
((100000, 10000000001000000) as $n
| "\nNumber of palindromic primes <= \($n): \(count(emit_until(. >= $n; palindromic_primes)))" )
</lang>
Line 366 ⟶ 365:
Number of palindromic primes <= 100000: 113
 
Number of palindromic primes <= 10000000001000000: 730113
</pre>
 
2,489

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.