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 17:59, 19 March 2021
, 3 years agoAdded Wren
(Added Wren) |
|||
Line 62:
found 34 primes
done...
</pre>
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
{{libheader|Wren-seq}}
<lang ecmascript>import "/math" for Int
import "/fmt" for Fmt
import "/seq" for Lst
var reversed = Fn.new { |n|
var rev = 0
while (n > 0) {
rev = rev * 10 + n % 10
n = (n/10).floor
}
return rev
}
var primes = Int.primeSieve(499)
var reversedPrimes = []
for (p in primes) {
if (Int.isPrime(reversed.call(p))) reversedPrimes.add(p)
}
System.print("Primes under 500 which are also primes when the digits are reversed:")
for (chunk in Lst.chunks(reversedPrimes, 17)) Fmt.print("$3d", chunk)
System.print("\n%(reversedPrimes.count) such primes found.")</lang>
{{out}}
<pre>
Primes under 500 which are also primes when the digits are reversed:
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
34 such primes found.
</pre>
| |||