Integers modulo n
Definition
Let be a positive integer. The integers modulo form the set of the residue classes modulo . Addition and multiplication on are and .
Remarks
The operations are well defined: the result does not depend on the choice of and in their classes. This follows from compatibility with addition and compatibility with multiplication.
With these operations, is a commutative ring with elements, with zero and identity .
Other notations are and . The Lean library Mathlib writes ZMod n, and it sets ZMod 0 to be .
The ring is a field if and only if is prime. See integers modulo a prime form a field.
Explanations
L1 human
In you compute as on a clock: . Products work the same way: .
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.
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Congruence is compatible with addition statement
- Congruence is compatible with multiplication statement
- Residue class definition
- Integers modulo n definition
What depends on this
2 nodes use this node, directly or through other nodes.
- Number of invertible residues modulo n 06RJWZCG95
- Integers modulo a prime form a field 0R8YXRC9AJ
Sources
- Web https://en.wikipedia.org/wiki/Modular_arithmetic, Integers modulo m
What links here
Used by
- Number of invertible residues modulo n 06RJWZCG95
- Integers modulo a prime form a field 0R8YXRC9AJ