Palindromic primes: Difference between revisions
Content added Content deleted
| Line 286: | Line 286: | ||
In this entry, we define both a naive generate-and-test generator of the palindromic primes, |
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 |
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]]. |
For a suitable implementation of `is_prime` as used here, see [[Erd%C5%91s-primes#jq]]. |
||
| Line 337: | Line 336: | ||
emit_until(. >= 1000; palindromic_primes), |
emit_until(. >= 1000; palindromic_primes), |
||
((100000, |
((100000, 1000000) as $n |
||
| "\nNumber of palindromic primes <= \($n): \(count(emit_until(. >= $n; palindromic_primes)))" ) |
| "\nNumber of palindromic primes <= \($n): \(count(emit_until(. >= $n; palindromic_primes)))" ) |
||
</lang> |
</lang> |
||
| Line 366: | Line 365: | ||
Number of palindromic primes <= 100000: 113 |
Number of palindromic primes <= 100000: 113 |
||
Number of palindromic primes <= |
Number of palindromic primes <= 1000000: 113 |
||
</pre> |
</pre> |
||