Math 2.0

Group theory and generalizations Example

Integers modulo n form a cyclic group

Builds on Integers modulo nCyclic group

Example

Let n≥1n \ge 1. The integers modulo nn, ℤ/nℤ={0,1,…,n−1}\mathbb{Z}/n\mathbb{Z} = \{0, 1, \dots, n-1\}, form a group under addition modulo nn. Each element kk is the sum 1+1+⋯+11 + 1 + \dots + 1 of kk copies of 11. Thus 11 is a generator, and the group is cyclic of order nn. Addition modulo nn 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Integers modulo n concept
  3. Laws of exponents in a group statement
  4. Subgroup definition
  5. Cyclic subgroup generated by an element definition
  6. Cyclic group definition
  7. Integers modulo n form a cyclic group example

Further reading

  1. Web https://en.wikipedia.org/wiki/Cyclic_group, Integer and modular addition
About this page
TagFB79N7AHZA
URIm2://FB79N7AHZA
Kindexample
WritingW0 stub
MSC20A05
Instance ofCyclic group, Abelian group
IllustratesCyclic groups are abelian
UsesIntegers 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.