Talk:Minimum multiple of m where digital sum equals m: Difference between revisions
Talk:Minimum multiple of m where digital sum equals m (view source)
Revision as of 13:37, 14 February 2022
, 2 years agodeleted no longer relevant section (misleading/wrong, plus the Phix entry explains it[self] better anyway)
(deleted no longer relevant section (misleading/wrong, plus the Phix entry explains it[self] better anyway)) |
|||
Line 168:
n<sub>20</sub>+n<sub>19</sub> must be at least 7. Each time n<sub>20</sub>+n<sub>19</sub> is incremented 1 must be subtracted from either No or Ne. The table above depicts the possibilities and is in fact a perfectly balanced binary tree. When a candidate is identified No and Ne must be expanded to the set of 8 digits summing to No and the set of 9 digits summing to Ne, and all combinations considered. In this case it is easy as 72 can only be 8 nines and 81 can only be 9 nines. Thus it only remains to prove that 70999999999999999995 is divisible by 3.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:37, 8 February 2022 (UTC)
==I'm out==
Gave up on 370. 275 still a little tardy/not done 25. Pretty pleased with 200 in 0.7s though
|