An integer a is called a quadratic residue modulo n if there exists an integer x such that x^2 ≡ a mod n. This topic has applications in cryptography and coding theory.
An integer a is called a quadratic residue modulo n if there exists an integer x such that x^2 ≡ a mod n. This topic has applications in cryptography and coding theory.