Integers modulo n as a quotient group
Example
Let be a positive integer. The subgroup of the additive group of integers is normal, because is abelian. The quotient group has the cosets . The operation is , which is addition modulo .
Remarks
The coset is the set of integers with the same remainder as on division by . Thus is the cyclic group of order of clock arithmetic. For , the quotient is isomorphic to .
Explanations
L1 human
Two integers are in the same coset of when their difference is a multiple of . So the quotient group keeps only the remainder modulo . Adding cosets is the same as adding remainders and reducing modulo .
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 19 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Binary operation definition
- Group concept
- Commutativity definition
- Conjugate elements definition
- Laws of exponents in a group statement
- Subgroup definition
- Abelian group definition
- Conjugate subgroup definition
- Cyclic subgroup generated by an element definition
- Left coset definition
- Right coset definition
- Additive group of integers example
- Cyclic group definition
- Normal subgroup definition
- Subgroups of cyclic groups are cyclic statement
- Normality via left and right cosets statement
- Subgroups of the integers statement
- Quotient group definition
- Integers modulo n as a quotient group example
Sources
- Web https://en.wikipedia.org/wiki/Quotient_group, Integer modular arithmetic
- Web https://en.wikipedia.org/wiki/Quotient_group, Remainders of integer division
What links here
No node links to this node yet.