Math 2.0

definition

Integers modulo n

Definition

Let nn be a positive integer. The integers modulo nn form the set Z/nZ={0‾,1‾,…,n−1‾}\mathbb{Z}/n\mathbb{Z} = \{ \overline{0}, \overline{1}, \dots, \overline{n - 1} \} of the residue classes modulo nn. Addition and multiplication on Z/nZ\mathbb{Z}/n\mathbb{Z} are a‾+b‾=a+b‾\overline{a} + \overline{b} = \overline{a + b} and a‾⋅b‾=ab‾\overline{a} \cdot \overline{b} = \overline{a b}.

Remarks

The operations are well defined: the result does not depend on the choice of aa and bb in their classes. This follows from compatibility with addition and compatibility with multiplication. With these operations, Z/nZ\mathbb{Z}/n\mathbb{Z} is a commutative ring with nn elements, with zero 0‾\overline{0} and identity 1‾\overline{1}. Other notations are Zn\mathbb{Z}_n and Z/(n)\mathbb{Z}/(n). The Lean library Mathlib writes ZMod n, and it sets ZMod 0 to be Z\mathbb{Z}. The ring is a field if and only if nn is prime. See integers modulo a prime form a field.

Explanations

L1 human

In Z/12Z\mathbb{Z}/12\mathbb{Z} you compute as on a clock: 9‾+5‾=14‾=2‾\overline{9} + \overline{5} = \overline{14} = \overline{2}. Products work the same way: 5‾⋅7‾=35‾=11‾\overline{5} \cdot \overline{7} = \overline{35} = \overline{11}.

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 6 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. Congruence is compatible with addition statement
  4. Congruence is compatible with multiplication statement
  5. Residue class definition
  6. Integers modulo n definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Modular_arithmetic, Integers modulo m