When looking for the square root of a natural number x modulo p, where p is prime, we look for natural numbers y so that $ y^2 \equiv_p x$.
With the exception of zero (obviously the only square root of zero is zero, modulo any p) it seems that there are always either 2 or 0 solutions.
For example when p=41:
$\sqrt{8} \equiv_{41} \{7,34\}$
$\sqrt{9} \equiv_{41} \{3,38\}$
$\sqrt{10} \equiv_{41} \{16,25\}$
$\sqrt{11} \equiv_{41} (none)$
$\sqrt{12} \equiv_{41} (none)$
$\sqrt{13} \equiv_{41} (none)$
Is this always true? Surely there is a known proof for this?
(edit) With the exception of p=2 because in that case 1 has only one square root. In general the square roots of 1 are always 1 and p-1 (or can there be more?) and if p=2 then these are the same. So I'm only interesting in p>2.