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 23:36, 2 March 2020
, 4 years ago→general observations: Agreed, though revered terms
(added a new talk section.) |
Thundergnat (talk | contribs) (→general observations: Agreed, though revered terms) |
||
Line 109:
I'm sure there is a more elegant way of expressing this, but I think showing is better than telling (the pattern seems obvious enough). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:48, 2 March 2020 (UTC)
: You are absolutely correct in your observation though technically you have the terms reversed. The B10 only contains digits 1 and 0. These are the multipliers to ''give'' the B10. Another way to look at it: any number devisable by 9 will have a multiple of 9 digits 1 in it. (It may, and likely will have some variable number of digits 0 too.) If the number n ''only'' contains digits 9 then it will consist of '1' repeated 9 times the number of 9 digits. (Which is exactly what you stated above, just coming at it from the opposite direction. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 23:36, 2 March 2020 (UTC)
| |||