Talk:Minimum positive multiple in base 10 using only 0 and 1: Difference between revisions
Content added Content deleted
| Line 128: | Line 128: | ||
1<sup>1</sup>0<sup>1</sup>0<sup>2</sup>0 -> 6 |
1<sup>1</sup>0<sup>1</sup>0<sup>2</sup>0 -> 6 |
||
1<sup>1</sup>0<sup>1</sup>0<sup>2</sup>1 -> |
1<sup>1</sup>0<sup>1</sup>0<sup>2</sup>1 -> 0 Success this is divisible by 7. |
||
Note that because (n mod 7) + (g mod 7) = (n+g) mod 7 I only need to calculate 100 mod 7 and I know say 110 mod 7 is (100 mod 7) + (10 mod 7) so I can calculate all possible sums by adding 100 mod 7 to the sums I already have in a modular way. |
Note that because (n mod 7) + (g mod 7) = (n+g) mod 7 I only need to calculate 100 mod 7 and I know say 110 mod 7 is (100 mod 7) + (10 mod 7) so I can calculate all possible sums by adding 100 mod 7 to the sums I already have in a modular way. |
||
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 15:00, 14 March 2020 (UTC) |
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 15:00, 14 March 2020 (UTC) |
||