Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /159 of 275

Romanian Mathematical Olympiad

Number theory Difficulty 5.9 AIME, harder Prove it Romania

Initially, a blackboard has written on it the numbers 1111 and 1313. Each minute an extra number appears on the blackboard, equaling the sum of two numbers already written on the blackboard. Prove that:

a) the number 8686 can not appear on the blackboard;

b) it is possible for 20152015 to appear on the blackboard at some point.

Solution

a) Each number appearing on the blackboard is of the form 11a+13b11a + 13b, with a,b∈N∗a, b \in \mathbb{N}^*. If 8686 appears on the board, then there exist a,b∈N∗a, b \in \mathbb{N}^* such that 86=11a+13b86 = 11a + 13b, whence b≤6b \le 6. Then 13b∈{13,26,39,52,65,78}13b \in \{13, 26, 39, 52, 65, 78\}, therefore 11a=86−13b∈{73,60,47,34,21,8}11a = 86 - 13b \in \{73, 60, 47, 34, 21, 8\}. Since none of these numbers is divisible by 1111, 8686 can not be written on the blackboard.

b) 2015=11⋅182+132015 = 11 \cdot 182 + 13. The number 20152015 can appear on the blackboard after 182182 minutes, in the following way: 13+11=24→+1113+2⋅11=35→+1113+3⋅11=46→+11⋯→+1113+182⋅11=201513 + 11 = 24 \xrightarrow{+11} 13 + 2 \cdot 11 = 35 \xrightarrow{+11} 13 + 3 \cdot 11 = 46 \xrightarrow{+11} \dots \xrightarrow{+11} 13 + 182 \cdot 11 = 2015.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.