Browse · MathNet
PrintBelarus2022
Belarus 2022 algebra
Problem
A positive integer is written on the board. Petya is allowed to replace the number on the board with the sum of the squares of its digits. We call a number interesting if Petya can't obtain from it using a finite number of such operations. Prove that there exist infinitely many interesting numbers.
Solution
Let us first prove that interesting numbers exist. Consider the cycle Each number in this cycle is obtained from the previous one by the operation described in the condition. Therefore, starting with any of the numbers in this cycle, Petya will never obtain . Hence, all numbers in this cycle are interesting.
Note that for any interesting number , the number , consisting of units in decimal notation, is also interesting, since the very first number that Petya writes on the blackboard will be equal to . Moreover, for any . Therefore, for any interesting number , there exists an interesting number greater than , whence the statement follows.
Note that for any interesting number , the number , consisting of units in decimal notation, is also interesting, since the very first number that Petya writes on the blackboard will be equal to . Moreover, for any . Therefore, for any interesting number , there exists an interesting number greater than , whence the statement follows.
Techniques
Recurrence relationsOther