Find prime n such that reversed n is also prime: Difference between revisions
Content added Content deleted
(Find prime n such that reversed n is also prime en Python) |
(Frink) |
||
| Line 586: | Line 586: | ||
print</lang> |
print</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> |
{{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|Frink}}== |
|||
<lang frink>select[primes[2,500], {|n| isPrime[parseInt[join["", reverse[integerDigits[n]]]]]}]</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|Go}}== |
=={{header|Go}}== |
||