Number theoryDifficulty 4.8Prove itIrish Mathematical Olympiad · Ireland · 2014
Find with proof, all triples of non-negative integers (x,y,n) satisfying (x4+1)3+(y4+1)3=2014n.
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.
Consider the given equation modulo 13. The squares modulo 13 are 0, ±1, ±3, ±4, so the fourth powers modulo 13 are 0, 1, 3, 9. Therefore x4+1 must be one of 1, 2, 4, 10 modulo 13. For z congruent to 1, 2, 4, 10 modulo 13, the value of z3 can only be ±1 or 8 modulo 13. Since 2014n≡(−1)n≡±1 modulo 13, the equation reduces to r+s≡±1(mod13) where r and s are either ±1 or 8 modulo 13 – 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.