Let m be a positive integer and um=m11…1. Prove that there is no positive integer multiple of um such that the sum of its digits is less than m.
Solution
Solution:
Assume the contrary. Then there exists a positive integer multiple of um such that the sum of its digits is less than m and let t be the smallest number with this property. Since t>10m, the number t can be written as t=10ma+b, where 0<b<10m.
We have t=10ma+b=(10m−1)a+a+b. Since um divides both t and 10m−1=9um, we conclude that um divides a+b. But the sum of the digits of a+b does not exceed the sum of the digits of t and a+b<t, a contradiction.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.