KöMaL problem A, 2019

Number theory Difficulty 5.0 AIME, harder Find the answer Hungary

Let $p$ be a prime number. How many solutions does the congruence $x^2+y^2+z^2+1\equiv0\pmod{p}$ have among the modulo $p$ remainder classes?

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.