Rosetta Code

Find prime n such that reversed n is also prime: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Added PL/M
PureFox (talk | contribs)
9,506 edits
m →‎{{header|Wren}}: Minor tidy
Line 1,627:
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="wren">import "./math" for Int
{{libheader|Wren-seq}}
<syntaxhighlight lang="ecmascript">import "./mathfmt" for IntFmt
import "/fmt" for Fmt
import "/seq" for Lst
 
var reversed = Fn.new { |n|
Line 1,647 ⟶ 1,645:
}
System.print("Primes under 500 which are also primes when the digits are reversed:")
Fmt.tprint("$3d", reversedPrimes, 17)
for (chunk in Lst.chunks(reversedPrimes, 17)) Fmt.print("$3d", chunk)
System.print("\n%(reversedPrimes.count) such primes found.")</syntaxhighlight>
 
Retrieved from "https://rosettacode.org/wiki/Find_prime_n_such_that_reversed_n_is_also_prime"