Olympiad Maths Prep

Library / /1 of 4

Number theory Difficulty 5.3 AIME, harder Prove it Bulgaria

Find all pairs (a,b)(a, b) of co-prime naturals such that a<ba < b and bb divides
(n+2)an+1002(n+1)an+1001nan+1000 (n + 2)a^{n+1002} - (n + 1)a^{n+1001} - n a^{n+1000}
for every natural number nn.

Solution

Since aa and bb are co-prime, so are bb and an+1000a^{n+1000}, respectively, what is requested is equivalent to bb dividing (n+2)a2(n+1)an(n + 2)a^2 - (n + 1)a - n for each nn.

From n=1n = 1 and n=2n = 2 we get that necessarily bb divides 3a22a13a^2 - 2a - 1 and 4a23a24a^2 - 3a - 2. Hence bb divides
4(3a22a1)3(4a23a2)=a+2 4(3a^2 - 2a - 1) - 3(4a^2 - 3a - 2) = a + 2
and since 3a22a1=3(a2)(a+2)2(a+2)+153a^2 - 2a - 1 = 3(a - 2)(a + 2) - 2(a + 2) + 15, then necessarily bb divides 1515.

Clearly b>a1b > a \ge 1, i.e. b2b \ge 2. If b=15b = 15, then ba+2b \mid a + 2 gives a=13a = 13, but 41323132=6354 \cdot 13^2 - 3 \cdot 13 - 2 = 635 is not divisible by 33. If b=3b = 3, then a=1a = 1, but 412312=14 \cdot 1^2 - 3 \cdot 1 - 2 = -1 is not divisible by 33.

It remains b=5b = 5, respectively a=3a = 3. Indeed, (n+2)32(n+1)31n=5(n+3)(n + 2) \cdot 3^2 - (n + 1) \cdot 3^1 - n = 5(n + 3) is divisible by 55. \square

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.