91Ó°ÊÓ

In number theory, a quadratic residue is an important concept when dealing with congruences and modular arithmetic, especially quadratic congruences. Simply put, given a modulo number, say an odd prime \( p \), an integer \( a \) is known to be a quadratic residue modulo \( p \) if there exists an integer \( x \) such that \( x^2 \equiv a \pmod{p} \). This tells us that \( a \) can be expressed as the square of some integer modulo \( p \).

• If such an \( x \) exists, \( a \) is a quadratic residue modulo \( p \).
• If no such \( x \) can be found, \( a \) is a non-residue.

Understanding whether \( b^2 - 4ac \) is a quadratic residue or not is crucial in determining the solvability of the quadratic congruence \( ax^2 + bx + c \equiv 0 \pmod{p} \). If \( b^2 - 4ac \equiv 0 \pmod{p} \) or is a quadratic residue, the equation will have solutions.

The Legendre symbol \( \left(\frac{a}{p}\right) \) is a powerful tool in number theory that helps us quickly ascertain the status of an integer \( a \) as a quadratic residue modulo a prime \( p \). It is defined as follows:

• \( \left(\frac{a}{p}\right) = 1 \) if \( a \) is a quadratic residue modulo \( p \) and \( a ot\equiv 0 \pmod{p} \).
• \( \left(\frac{a}{p}\right) = -1 \) if \( a \) is a non-residue modulo \( p \).
• \( \left(\frac{a}{p}\right) = 0 \) if \( a \equiv 0 \pmod{p} \).

In problems involving quadratic congruences, the Legendre symbol provides an efficient way to determine if a discriminant \( b^2 - 4ac \) is solvable. When \( \left(\frac{b^2 - 4ac}{p}\right) = 1 \), it signals that the discriminant is a quadratic residue, suggesting that the quadratic equation has solutions modulo \( p \).
The Legendre symbol simplifies the process of checking quadratic residues, offering a binary approach to confirm solvability of congruences.

In number theory, the discriminant of a quadratic equation \( ax^2 + bx + c = 0 \) is given by \( b^2 - 4ac \). This discriminant plays a pivotal role in determining the nature of roots of the equation, not just over real numbers but also in the context of modular arithmetic. In quadratic congruences, the discriminant determines:

• Whether the congruence has real integer solutions modulo \( p \).
• If these solutions are unique or not.

When applying the discriminant in modular scenarios, if \( b^2 - 4ac \equiv 0 \pmod{p} \) or is a quadratic residue modulo \( p \), it indicates that the congruence has at least one solution. This relationship highlights the importance of the discriminant as:

• Zero, implying a perfect square. The equation becomes a perfect square trinomial having a double root.
• Also serving as a key in identifying if its square root exists under modular arithmetic, implying solvability.

The discriminant thus acts as a gateway to understanding the nature of quadratic congruences and their solutions in modular arithmetic.