Largest palindrome product: Difference between revisions
Content added Content deleted
(added RPL) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| Line 1,432: | Line 1,432: | ||
=={{header|Wren}}== |
=={{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. |
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=" |
<syntaxhighlight lang="wren">var reverse = Fn.new { |n| |
||
var r = 0 |
var r = 0 |
||
while (n > 0) { |
while (n > 0) { |
||