Math 2.0

example

Cyclic group of order n

Example

Let nn be a positive integer. The integers modulo nn, Z/nZ={0,1,…,n−1}\mathbb{Z}/n\mathbb{Z} = \{0, 1, \ldots, n - 1\}, with addition modulo nn, form a cyclic group of order nn. The residue 11 generates it, because each residue kk is the sum of kk copies of 11. Each cyclic group of order nn is isomorphic to Z/nZ\mathbb{Z}/n\mathbb{Z}, and this group is often written CnC_n.

Remarks

A residue kk generates Z/nZ\mathbb{Z}/n\mathbb{Z} exactly when gcd⁡(k,n)=1\gcd(k, n) = 1. The group of nnth roots of unity is a cyclic group of order nn in multiplicative notation. The rotations of a regular nn-gon also form a cyclic group of order nn.

Explanations

L1 human

Think of a clock with nn hours, where you add hours and wrap around after nn. This clock arithmetic gives the cyclic group of order nn. Every cyclic group of order nn looks the same as this clock, up to the names of the elements.

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 7 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. Group concept
  2. Laws of exponents in a group statement
  3. Order of a group definition
  4. Subgroup definition
  5. Cyclic subgroup generated by an element definition
  6. Cyclic group definition
  7. Cyclic group of order n example

Sources

  1. Web https://en.wikipedia.org/wiki/Cyclic_group, Integer and modular addition