This theorem counts solutions of a quadratic congruence modulo an odd prime from the [Legendre symbol](/page/Legendre%20Symbol) of its discriminant. It is the modular analogue of using the discriminant to decide how many roots a quadratic equation has.