Math 2.0

Number theory Definition

Residue class

Builds on Congruence modulo n

Definition

Let nn be a positive integer and let aa be an integer. The residue class of aa modulo nn is the set a‾={b∈ℤ:b≡a(modn)}\overline{a} = \{ b \in \mathbb{Z} : b \equiv a \pmod n \} of the integers congruent to aa modulo nn. Thus a‾={a+kn:k∈ℤ}=a+nℤ\overline{a} = \{ a + k n : k \in \mathbb{Z} \} = a + n \mathbb{Z}.

Remarks

Two residue classes a‾\overline{a} and b‾\overline{b} are equal if a≡b(modn)a \equiv b \pmod n, and they have no common element otherwise. There are exactly nn residue classes modulo nn: 0‾,1‾,…,n−1‾\overline{0}, \overline{1}, \dots, \overline{n - 1}. Other notations are [a][a], [a]n[a]_n and a mod na \bmod n. The residue classes are the elements of the ring of integers modulo n.

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. Residue class definition

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Modular_arithmetic, Congruence classes
About this page
Tag0QRV8FPK5M
URIm2://0QRV8FPK5M
Aliasescongruence-class
Kinddefinition
WritingW1 stated
MSC11A07
DefinesResidue class
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