Skip to main content
OlympiadHQ

Browse · MathNet

Print

37th Hellenic Mathematical Olympiad 2020

Greece 2020 counting and probability

Problem

On the blackboard are written in a line the numbers from to in increasing turn. We have the possibility of the “movement” : We select two numbers , from the blackboard written in successive positions and we substitute the pair (, ) with the number .

We perform the movement as many times as we need in order to have on the blackboard only one number. Examine, if this number can be:

(a) ,

(b) .
Solution
(a) First we observe that: At every movement , the numbers and are congruent modulo , that is, both are even or both are odd. Therefore, after the substitution of with the number the parity of the sum of the numbers on the blackboard remains invariant. Since

is odd, it follows that after the last movement the number remaining on the blackboard is odd and therefore the answer in the first question is negative.

(b) Let after performing the movement enough number of times we have on the blackboard two numbers . Then the only case in order no one of them is not a power of , is not to have taken part in any performed movement. This can happen only with the numbers and . Since is , it is enough to check . If and , then we must have . For there is no solution and for we get , impossible.

In any other case we will have from the procedure that and , for some and . By performing the last movement, remains on the blackboard the number . We have to check if it is possible to be valid the following equality:



If , it is not valid. We suppose wlog . Then we must check if



The least possible value of is , for . From (1) we have that , and hence . Therefore . By developing the last expression we observe that all coefficients of have positive sign and so it is increasing. Hence and therefore it cannot be equal to .
Final answer
(a) No; (b) No

Techniques

Invariants / monovariantsIntegersPolynomial operationsSums and products