In number theory, an integer q is a quadratic residue modulo n if it is congruent to a perfect square modulo n; that is, if there exists an integer x such that x 2 ≡ q ( mod n ) . {\displaystyle x^{2}\equiv q{\pmod {n}}.} Otherwise, q is a quadratic nonresidue modulo n.
In number theory, an integer q is a quadratic residue modulo n if it is congruent to a perfect square modulo n; that is, if there exists an integer x such that x 2 ≡ q ( mod n ) . {\displaystyle x^{2}\equiv q{\pmod {n}}.} Otherwise, q is a quadratic nonresidue modulo n.
Source: Wikipedia "Quadratic residue" · CC BY-SA 4.0
Share this article: X · Bluesky