Maths Olympiad Prep

Track / Stage 4 / 199 of 340 #939 of 2444

Problem 939

AMC 12 late, AIME early
Number theory Difficulty 4.8 Prove it Irish Mathematical Olympiad · Ireland · 2014

Find with proof, all triples of non-negative integers (x,y,n)(x, y, n) satisfying
(x4+1)3+(y4+1)3=2014n. (x^4 + 1)^3 + (y^4 + 1)^3 = 2014^n.

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

Consider the given equation modulo 1313. The squares modulo 1313 are 00, ±1\pm 1, ±3\pm 3, ±4\pm 4, so the fourth powers modulo 1313 are 00, 11, 33, 99. Therefore x4+1x^4 + 1 must be one of 11, 22, 44, 1010 modulo 1313. For zz congruent to 11, 22, 44, 1010 modulo 1313, the value of z3z^3 can only be ±1\pm 1 or 88 modulo 1313.
Since 2014n(1)n±12014^n \equiv (-1)^n \equiv \pm 1 modulo 1313, the equation reduces to
r+s±1(mod13) r + s \equiv \pm 1 \pmod{13}
where rr and ss are either ±1\pm 1 or 88 modulo 1313 – this can easily be seen to have no solutions.

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