Largest palindrome product: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
(added RPL) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
Line 1,432:
=={{header|Wren}}==
The approach here is to manufacture palindromic numbers of length 2n in decreasing order and then see if they're products of two n-digit numbers.
<syntaxhighlight lang="
var r = 0
while (n > 0) {
| |||