Math 2.0

Number theory Definition

Complete residue system

Builds on Residue class

Definition

Let nn be a positive integer. A complete residue system modulo nn is a set SS of integers that contains exactly one element of each residue class modulo nn.

Remarks

Equivalently, SS has exactly nn elements, and no two distinct elements of SS are congruent modulo nn. The set {0,1,…,n−1}\{0, 1, \dots, n - 1\} is the set of the least nonnegative residues. It is a complete residue system modulo nn. For odd nn, the set {−n−12,…,−1,0,1,…,n−12}\{ -\tfrac{n-1}{2}, \dots, -1, 0, 1, \dots, \tfrac{n-1}{2} \} of the least absolute residues is also a complete residue system. If SS is a complete residue system modulo nn and gcd⁡(a,n)=1\gcd(a, n) = 1, then {as+b:s∈S}\{ a s + b : s \in S \} is also a complete residue system for each integer bb.

Reading path

To understand this page from the ground up, read these 4 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. Residue class definition
  4. Complete residue system definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Modular_arithmetic, Residue systems
About this page
Tag0E22JKS4W4
URIm2://0E22JKS4W4
Aliasescomplete-system-of-residues
Kinddefinition
WritingW0 stub
MSC11A07
DefinesComplete residue system
UsesResidue class

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What links here

No page links to this page yet.