Library / /7 of 151

, 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?

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 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.