Skip to main content
OlympiadHQ

Browse · MathNet

Print

Final Round of National Olympiad

Estonia number theory

Problem

Find the smallest natural number for which there exist integers (that do not have to be different) such that .
Solution
Answer: 14.

Note that the fourth powers of even numbers are divisible by 16 and the fourth powers of odd numbers are congruent to 1 modulo 16. As , the desired representation must contain at least 13 odd summands.

Suppose that no more summands are needed. As , each summand must be , or . There can be at most 3 summands 625 since . Therefore the number of summands not divisible by 5 is at least 10. The fourth power of an integer not divisible by 5 is congruent to 1 modulo 5, whereas . Hence the number of summands not divisible by 5 must be at least 13. This shows that the representation contains only summands 1 and 81, but 13 such numbers sum up to at most which is less than 2013. Thus representations with 13 summands are impossible.

On the other hand, 14 fourth powers is enough as .
Final answer
14

Techniques

Modular ArithmeticTechniques: modulo, size analysis, order analysis, inequalities