Browse · MathNet
PrintJapan Mathematical Olympiad
Japan counting and probability
Problem
There are three distinct positive integers written on the blackboard. When real numbers , , are on the blackboard, consider the procedure that replaces those three numbers with , , at the same time. After this procedure is done times, all three numbers on the blackboard are positive integers. Determine the minimum value of the sum of initial three positive integers on the blackboard.
Solution
For integers , let be three numbers on the blackboard after the procedure is done times and let , . Here means the initial status. When the procedure is done once, three numbers are replaced with hence , holds. Therefore , . Initial three numbers are distinct thus neither of is and then neither of is . All three numbers after procedures are positive integers hence , and , . The minimum number of initial three numbers is greater than or equal to thus the sum of initial three numbers is greater than or equal to .
We show , , satisfy the condition of initial three numbers. Discussion above shows , . The sum of three numbers is kept unchanged by the procedure thus the sum is after procedures. Therefore three numbers after procedures are , , and these are all integers. Hence the answer is .
Final answer
3 * 2^2021 + 3
Techniques
Invariants / monovariantsRecurrence relationsIntegers