Revision as of 03:51, 24 December 2021 (view source) Petelomax (talk \| contribs) (→‎Why not 1001 or 900625) ← Older edit		Revision as of 03:54, 24 December 2021 (view source) Petelomax (talk \| contribs) (→‎Why not 1001 or 900625) Newer edit →
Line 45: Then g<sub>n</sub> is always 2n%10 which never equals n.--[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 14:15, 23 December 2021 (UTC) :Excellent stuff. Likewise on the latter point we cannot "zero-fill" the single digit g<sub>0</sub>=5 or g<sub>0</sub>=6 because ~~neither~~ g<sub>~~1</sub> nor g<sub>n+~~1</sub> can ~~ever~~never be 0 ~~(with either being sufficient grounds for permanent elimination)~~. Going back to the first paragraph, another way to say that (as a guide rather than a proof) might be, using the triple-zero-fill example above: 55742..90625^2 = ...6100055742..90625 100055742..90625^2 = ...1100055742..90625

Talk:Steady squares: Difference between revisions

Talk:Steady squares (view source)