Problem

Source: Iranian third round 2018 number theroy exam problem 1

Tags: number theory



$n\ge 2 $ is an integer.Prove that the number of natural numbers $m$ so that $0 \le m \le n^2-1,x^n+y^n \equiv m (mod n^2)$ has no solutions is at least $\binom{n}{2}$