Browse · MathNet
PrintUkrajina 2008
Ukraine 2008 algebra
Problem
natural numbers are written on the board. You can add only natural numbers in the form where and are the numbers already written on the board. It appears that by doing so you can make any natural number appear on the board. Calculate the least value of and find the numbers initially written (consider all the cases).
Solution
As , you can not obtain performing the operations allowed. Therefore it should be written on the board, but one number is not enough. Let's show that two numbers will be enough. Let another number of the two be . is the only number which can be obtained in the first step. Since it is a natural number, or . Thus the second number should be or . We obtain the two possible sets: and .
Let's prove that they both satisfy the condition. As and , in the first step we obtain the set in both cases. Now we have to prove that any natural number greater than can be obtained from these three numbers.
Let's assume that we've already obtained the set . Let's show how we can obtain the next two numbers. We obtain number from numbers . Next we obtain from numbers . This implies the desired result.
Let's prove that they both satisfy the condition. As and , in the first step we obtain the set in both cases. Now we have to prove that any natural number greater than can be obtained from these three numbers.
Let's assume that we've already obtained the set . Let's show how we can obtain the next two numbers. We obtain number from numbers . Next we obtain from numbers . This implies the desired result.
Final answer
Minimum n is 2; the valid initial sets are {1,2} and {1,3}.
Techniques
IntegersLinear and quadratic inequalitiesInduction / smoothing