Maths Olympiad Prep

Library / /10 of 101

Number theory Difficulty 5.3 AIME, harder Prove it Estonia

Is there a positive integer nn such that 8888 divides 2n+n32^n + n^3?

Solution

Taking n=10n = 10 gives 2n+n3=1024+1000=2024=88232^n + n^3 = 1024 + 1000 = 2024 = 88 \cdot 23, so 8888 divides 210+1032^{10} + 10^3.

We consider divisibility by 1111 and by 88 separately. By Fermat's little theorem, we have 2101(mod11)2^{10} \equiv 1 \pmod{11}, whereas 103(1)3=1(mod11)10^3 \equiv (-1)^3 = -1 \pmod{11}. In summary 210+10311=0(mod11)2^{10} + 10^3 \equiv 1 - 1 = 0 \pmod{11}, meaning that 1111 divides 210+1032^{10} + 10^3. As 88 divides both 2102^{10} and 10310^3, it divides the sum 210+1032^{10} + 10^3. Thus 8888 divides 210+1032^{10} + 10^3, as desired.

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 and solution reproduced as published; topic and difficulty added by this site.