Talk:Rare numbers: Difference between revisions
→30 mins not 30 years
Line 14:
::* when the number of digits in a rare number is ''odd'', the '''difference''' must be divisible by '''9'''.
===
If Shyam Sunder Gupta has really spent
<pre>
Let me consider n-r=l for a 2 digit number ng n<g. Then l=(10g+n)-(g+10n)=9(g-n) where n is 0..8 and g is 1..9.
Line 55:
x dissappears leaving 99(111(e-n)+10(g-i))
</pre>--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:34, 12 September 2019 (UTC)
:I have turned the computer on and produced a solution using only the above and nothing from the referenced website which completes in under a minute. The reference is rubbish, consider removing it--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 10:42, 18 September 2019 (UTC)
== the 1<sup>st</sup> REXX version ==
|