Maths Olympiad Prep

Track / Stage 5 / 283 of 400 #1363 of 2444

Problem 1363

AIME late
Number theory Difficulty 5.6 Prove it National Xxx Oma · Argentina

Given a positive integer NN, we subtract from it its greatest proper divisor (different from NN), then do the same with the new number and repeat the operation until 11 is obtained. Find how many subtractions are there if the process starts with N=1919N = 19^{19}.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Since 1919 is a prime, the greatest proper divisor of N=1919N = 19^{19} is 191819^{18} and the first number obtained is N1=19191918=181918N_1 = 19^{19} - 19^{18} = 18 \cdot 19^{18}. Note that if a number mm is even then the operation gives m/2m/2. So the next number is N2=N1/2=91918N_2 = N_1/2 = 9 \cdot 19^{18}. The greatest proper divisor of 919189 \cdot 19^{18} is 319183 \cdot 19^{18}, hence

N3=9191831918=61918N_3 = 9 \cdot 19^{18} - 3 \cdot 19^{18} = 6 \cdot 19^{18}.

Now, as it is an even number, N4=31918N_4 = 3 \cdot 19^{18}. Its greatest proper divisor is 191819^{18}, then N5=319181918=21918N_5 = 3 \cdot 19^{18} - 19^{18} = 2 \cdot 19^{18} and N6=1918N_6 = 19^{18}.

We see that 66 operations transform 191919^{19} to 191819^{18} so it takes another 66 to reach 191719^{17}, and so on. In order to end with 1=1901 = 19^0, the process takes up 619=1146 \cdot 19 = 114 operations.

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