Talk:Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions
Talk:Minimum positive multiple in base 10 using only 0 and 1 (view source)
Revision as of 15:56, 2 March 2020
, 4 years ago→How does it work "C code for Ed Pegg Jr's 'Binary' Puzzle algorithm" ?
Line 94:
--[[User Horst.h|Horst.h]] 14:10, 2 March 2020 (UTC)~
:No idea, however I had four (unrelated) minor insights: 1) B10(n) where n is all-nines is all-ones, in fact 9*length(n) ones. 2) No smallest multiplier ends with 0. 3) B10(2n) is either B10(n) or B10(n)*10, and the multiplier must end in 5. 4) for B10(k*10+n) where n is odd {1,3,5,7,9}, the multiplier must end in {1,7,(2/4/6/8),3,9}. None of those really help explain anything though. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:36, 2 March 2020 (UTC)
| |||