Find prime n such that reversed n is also prime: Difference between revisions
Content added Content deleted
(→{{header|REXX}}: added the computer programming language REXX.) |
m (→{{header|Phix}}: extended output) |
||
| Line 7: | Line 7: | ||
=={{header|Phix}}== |
=={{header|Phix}}== |
||
<lang Phix>function rp(integer p) return is_prime(to_integer(reverse(sprint(p)))) end function |
<lang Phix>function rp(integer p) return is_prime(to_integer(reverse(sprint(p)))) end function |
||
procedure test(sequence args) |
|||
for n=500 to 1000 by 500 do |
|||
{integer n, string fmt} = args |
|||
sequence res = filter(get_primes_le(n),rp) |
|||
sequence res = apply(true,sprintf,{{"%3d"},filter(get_primes_le(n),rp)}) |
|||
string r = sprintf(fmt,{join_by(res,1,length(res)/2," ")}) |
|||
printf(1,"%d reverse primes < %,d found%s\n",{length(res),n,r}) |
|||
end for</lang> |
|||
end procedure |
|||
papply({{500,":\n%s"},{1000,":\n%s"},{10000,"."}},test)</lang> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
| Line 21: | Line 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 |
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 |
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> |
</pre> |
||