Math 2.0

definition

Residue class

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∈Z: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∈Z}=a+nZ\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.

Explanations

L1 human

Modulo 33, each integer falls in one of three boxes: the multiples of 33, the numbers 11 more than a multiple of 33, and the numbers 22 more. Each box is a residue class. For example, 1‾={…,−5,−2,1,4,7,… }\overline{1} = \{ \dots, -5, -2, 1, 4, 7, \dots \}.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Congruence modulo n definition
  3. Residue class definition

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Modular_arithmetic, Congruence classes