Puzzle Answer #4
![]()
| a * 10,000 + b * 1,000 + c * 100 + d * 10 + e | ||
| = | a * (9,999 + 1) + b * (999 + 1) + c * (99 + 1) + d * (9 + 1) + e * 1 | |
| = | (a * 9,999 + b * 999 + c * 99 + d * 9) + (a + b + c + d + e) | |
| = | 9 * (a * 1,111 + b * 111 + c * 11 + d * 1) + (a + b + c + d + e) | |
| From the above, 9 *
(a * 1,111 + b * 111 + c * 11 + d * 1) must be divisible by 9 because it
is a factor of 9. So, if (a + b + c + d + e) is also a factor of 9, then
the entire number must be a factor of 9. As a conclusion, the smallest number consisting of all 1's and divisible by 9 is thus 111,111,111. Adding the two zeros at the end of 111,111,111, the answer to the problem is 11,111,111,100.
|