Find prime n such that reversed n is also prime: Difference between revisions
Find prime n such that reversed n is also prime (view source)
Revision as of 08:29, 23 June 2021
, 2 years agoAdded Quackery.
(Add Seed7 example) |
(Added Quackery.) |
||
Line 510:
82,439 reverse primes < 10,000,000 found.
</pre>
=={{header|Quackery}}==
<code>eratosthenes</code> and <code>isprime</code> are defined at [[Sieve of Eratosthenes#Quackery]].
<lang Quackery> 1000 eratosthenes
[ number$ reverse $->n drop ] is revnum ( n --> n )
[ dup isprime iff
[ revnum isprime ]
else [ drop false ] ] is isrevprime ( n --> b )
[] [] 500 times
[ i^ isrevprime if
[ i^ join ] ]
witheach [ number$ nested join ]
60 wrap$</lang>
{{out}}
<pre>2 3 5 7 11 13 17 31 37 71 73 79 97 101 107 113 131 149 151
157 167 179 181 191 199 311 313 337 347 353 359 373 383 389
</pre>
=={{header|Raku}}==
| |||