Maths Olympiad Prep

Library / February /34 of 62

February, 2017

Number theory Difficulty 5.4 AIME, harder Prove it United States

Problem:

Find all pairs (a,b)(a, b) of positive integers such that a2017+ba^{2017}+b is a multiple of aba b.

Solution

Solution:

We want ab∣a2017+ba b \mid a^{2017}+b. This gives that a∣ba \mid b. Therefore, we can set b=b2017ab = b_{2017} a. Substituting this gives b2017a2∣a2017+b2017ab_{2017} a^{2} \mid a^{2017} + b_{2017} a, so b2017a∣a2016+b2017b_{2017} a \mid a^{2016} + b_{2017}. Once again, we get a∣b2017a \mid b_{2017}, so we can set b2017=b2016ab_{2017} = b_{2016} a. Continuing this way, if we have bi+1a∣ai+bi+1b_{i+1} a \mid a^{i} + b_{i+1}, then a∣bi+1a \mid b_{i+1}, so we can set bi+1=biab_{i+1} = b_{i} a and derive bia∣ai−1+bib_{i} a \mid a^{i-1} + b_{i}. Continuing down to i=1i=1, we would have b=b1a2017b = b_{1} a^{2017} so ab1∣1+b1a b_{1} \mid 1 + b_{1}. If a≥3a \geq 3, then ab1>1+b1a b_{1} > 1 + b_{1} for all b1≥1b_{1} \geq 1, so we need either a=1a=1 or a=2a=2.

If a=1a=1, then b∣b+1b \mid b+1, so b=1b=1. This gives the pair (1,1)(1,1).

If a=2a=2, we need 2b∣b+220172b \mid b + 2^{2017}. Therefore, we get b∣22017b \mid 2^{2017}, so we can write b=2kb = 2^{k} for 0≤k≤20170 \leq k \leq 2017. Then we need 2k+1∣2k+220172^{k+1} \mid 2^{k} + 2^{2017}. As k≤2017k \leq 2017, we need 2∣1+22017−k2 \mid 1 + 2^{2017-k}. This can only happen if k=2017k=2017. This gives the pair (2,22017)(2, 2^{2017}).

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.