Browse · MathNet
Print58th Ukrainian National Mathematical Olympiad
Ukraine number theory
Problem
For natural number let denote sum of its digits. From all pairs of natural numbers , that satisfy equality , find such, for which sum takes the least possible value.
Solution
Numbers and have the following ratios: , or , and the last inequality can not be true for two numbers in a row. As , and there are no other factor decompositions, that satisfy the condition, so the following cases are possible: , and ; , and ; * , , and .
If and , so we get contradiction as in the previous case. If and , so or . Then and . As , so these variants are possible, and number has to have in the end 112 digits 9. The least value for is .
If and , so we get contradiction as in the previous case. If and , so or . Then and . As , so these variants are possible, and number has to have in the end 112 digits 9. The least value for is .
Final answer
n = 1 followed by 112 nines; m = 1
Techniques
Factorization techniquesOtherIntegers