Maths Olympiad Prep

Library / /7 of 11

, 2015

Number theory Difficulty 8.3 Shortlist Prove it Mongolia

Find all pairs of positive integers (a,b)(a, b) such that apbp1a^p - b^p - 1 is divisible by 4343 for every prime p5p \ge 5.

Solution

*Answer: (a,b){(43n,43m1), (43n42,43m), (43n6,43m7), (43n+743,43m+643)n,mZ1}.(a, b) \in \{(43n, 43m-1),\ (43n-42, 43m),\ (43n-6, 43m-7),\ (43n+7-43, 43m+6-43) \mid n, m \in \mathbb{Z}_{\ge 1}\}.*

If p=43p = 43 then it follows from Fermat's little theorem that ab+1(mod43)a \equiv b+1 \pmod{43}. Hence if aa is divisible by 4343 then b1(mod43)b \equiv -1 \pmod{43} and if bb is divisible by 4343 then a1(mod43)a \equiv 1 \pmod{43}. For such a pair (a,b)(a, b), it is clear that apbp1a^p - b^p - 1 is divisible by 4343 for every prime pp. Thus, we can assume that abab is not divisible by 4343.

Since a41b411a^{41} - b^{41} - 1 is divisible by 4343 we obtain
bba42ab42+aba+ab(mod43). b \equiv b a^{42} \equiv a b^{42} + a b \equiv a + a b \pmod{43}.
Thus b2+b+10(mod43)b^2 + b + 1 \equiv 0 \pmod{43}, implying that b6(mod43)b \equiv 6 \pmod{43} and a7(mod43)a \equiv 7 \pmod{43} respectively. To see that a41b411a^{41} - b^{41} - 1 is divisible by 4343 for any p5p \ge 5, it is enough to see that (b+1)pbp10(modb2+b+1)(b+1)^p - b^p - 1 \equiv 0 \pmod{b^2 + b + 1} which follows from (b2)pbp10(modb2+b+1)(-b^2)^p - b^p - 1 \equiv 0 \pmod{b^2 + b + 1}.

Want a route through all this instead of 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 reproduced verbatim; metadata (topic, difficulty) added by this project.