Math 2.0

Number theory Definition

Quadratic residue

Builds on Congruence modulo n

Definition

Let nn be a positive integer and let qq be an integer. Then qq is a quadratic residue modulo nn if there is an integer xx with x2≡q(modn)x^2 \equiv q \pmod n. Otherwise qq is a quadratic nonresidue modulo nn.

Remarks

Many texts also require gcd⁡(q,n)=1\gcd(q, n) = 1, and so they do not count 00 as a quadratic residue. Modulo 77, the squares of 1,…,61, \dots, 6 are 1,4,2,2,4,11, 4, 2, 2, 4, 1. So the nonzero quadratic residues modulo 77 are 11, 22 and 44. Modulo an odd prime pp, exactly (p−1)/2(p - 1)/2 of the classes 1,…,p−11, \dots, p - 1 are quadratic residues. The product of two quadratic residues is a quadratic residue.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Congruence modulo n definition
  3. Quadratic residue definition

Where this leads

18 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Quadratic_residue, History, conventions, and elementary facts
About this page
Tag0SQDB87Z3T
URIm2://0SQDB87Z3T
Aliasesquadratic-nonresidue
Kinddefinition
WritingW1 stated
MSC11A15
DefinesQuadratic residue
UsesCongruence modulo n

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by