Talk:Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions
Content added Content deleted
m (→How does it work "C code for Ed Pegg Jr's 'Binary' Puzzle algorithm" ?: removed relict of copy&paste) |
|||
Line 98: | Line 98: | ||
:I've added a reference "How to find Minimum Positive Multiple in base 10 using only 0 and 1" which I think helps.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:49, 3 March 2020 (UTC) |
:I've added a reference "How to find Minimum Positive Multiple in base 10 using only 0 and 1" which I think helps.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:49, 3 March 2020 (UTC) |
||
:Thanks, that helps allot --[[User Horst.h|Horst.h]] 14:09, 3 March 2020 (UTC) |
:Thanks, that helps allot --[[User Horst.h|Horst.h]] 14:09, 3 March 2020 (UTC) |
||
::On [https://math.stackexchange.com/questions/388165/how-to-find-the-smallest-number-with-just-0-and-1-which-is-divided-by-a-give that link], I see |
|||
10<sup>0</sup> = 1 mod 7 possible sums: 1 |
|||
10<sup>1</sup> = 10 = 3 mod 7 possible sums: 1, 3, 4 |
|||
10<sup>2</sup> = 10*3 = 30 = 2 mod 7 possible sums: 1, 2, 3, 4, 5, 6 |
|||
::but on the third line, I don't get the "10^2==10*3" part. What do I need to read to clue me in on that? --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 04:10, 5 March 2020 (UTC) |
|||
== general observations == |
== general observations == |