Group theory and generalizations Example
Integers modulo n form a cyclic group
Builds on Integers modulo nCyclic group
Example
Let . The integers modulo , , form a group under addition modulo . Each element is the sum of copies of . Thus is a generator, and the group is cyclic of order . Addition modulo is commutative, so the group is abelian. This agrees with the result that cyclic groups are abelian.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Integers modulo n concept
- Laws of exponents in a group statement
- Subgroup definition
- Cyclic subgroup generated by an element definition
- Cyclic group definition
- Integers modulo n form a cyclic group example
Further reading
- Web https://en.wikipedia.org/wiki/Cyclic_group, Integer and modular addition
About this page
| Tag | FB79N7AHZA |
|---|---|
| URI | m2://FB79N7AHZA |
| Kind | example |
| Writing | W0 stub |
| MSC | 20A05 |
| Instance of | Cyclic group, Abelian group |
| Illustrates | Cyclic groups are abelian |
| Uses | Integers modulo n, Cyclic group |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.
What links here
No page links to this page yet.