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 05:25, 20 March 2021
, 3 years ago→{{header|Phix}}: extended output
(→{{header|REXX}}: added the computer programming language REXX.) |
m (→{{header|Phix}}: extended output) |
||
Line 7:
=={{header|Phix}}==
<lang Phix>function rp(integer p) return is_prime(to_integer(reverse(sprint(p)))) end function
procedure test(sequence args)
{integer n, string fmt} = args
printf(1,"%d reverse primes < %,d found%s\n",{length(res),n,r})
end procedure
papply({{500,":\n%s"},{1000,":\n%s"},{10000,"."}},test)</lang>
{{out}}
<pre>
Line 21 ⟶ 23:
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 701 709 727 733 739 743 751 757 761 769 787 797 907 919 929 937 941 953 967 971 983 991
260 reverse primes < 10,000 found.
</pre>
| |||