Prove that there exist infinitely many integers for which the sum of the digits in the decimal representation of is at most 2.
Mediterranean Mathematical Competition
Solution
This is an easy problem with many solutions. We rewrite
The two factors and add up to . If we choose the values of and so that and , then the product will become and the sum of the digits will equal 2.
Summarizing, we pick an integer and set and . The desired equation is equivalent to , and hence
Note that indeed is a positive integer. As the described choice of then yields
the proof is complete.
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.