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 02:13, 29 March 2021
, 3 years agoentry ordering
m (→{{header|Phix}}: added syntax colouring the hard way) |
m (entry ordering) |
||
Line 267:
34 such primes found.
</pre>▼
=={{header|Julia}}==▼
<lang julia>using Primes▼
let▼
pmask, pcount = primesmask(1, 994), 0▼
isreversibleprime(n) = pmask[n] && pmask[evalpoly(10, reverse(digits(n)))]▼
println("Reversible primes between 0 and 500:")▼
for n in 1:499▼
if isreversibleprime(n)▼
pcount += 1▼
print(rpad(n, 4), pcount % 17 == 0 ? "\n" : "")▼
end▼
end▼
println("Total found: $pcount")▼
end▼
</lang>{{out}}▼
<pre>▼
Reversible primes between 0 and 500:▼
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▼
Total found: 34▼
</pre>
Line 339 ⟶ 315:
167 179 181 191 199 311 313 337 347 353
359 373 383 389</pre>
▲=={{header|Julia}}==
▲<lang julia>using Primes
▲let
▲ pmask, pcount = primesmask(1, 994), 0
▲ isreversibleprime(n) = pmask[n] && pmask[evalpoly(10, reverse(digits(n)))]
▲ println("Reversible primes between 0 and 500:")
▲ for n in 1:499
▲ if isreversibleprime(n)
▲ pcount += 1
▲ print(rpad(n, 4), pcount % 17 == 0 ? "\n" : "")
▲ end
▲ end
▲ println("Total found: $pcount")
▲end
▲</lang>{{out}}
▲<pre>
▲Reversible primes between 0 and 500:
▲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
▲Total found: 34
▲</pre>
=={{header|Perl}}==
| |||