maths.free › Abstract Algebra › Cyclic groups and permutation groups

Cyclic groups and permutation groups

Generators, orders, cycles, transpositions, parity.

A cyclic group is generated by one element; every permutation is a product of disjoint cycles, and its parity (even/odd) is well defined. Picture it: shuffling 5 cards as arrows between positions; a cycle is a loop of arrows. Think it: Cayley's theorem, every group is a permutation group, means permutations are the universal example.

例題 · inverse of 5 mod 12

Inverse of 5 mod 12

5,\ 12

ステップバイステップ

  1. 5x \equiv 1 \pmod{12}

    We want x with a·x ≡ 1 (mod m). It exists only when gcd(a, m) = 1.

  2. 12 = 2 \times 5 + 2

    Euclid step.

  3. 5 = 2 \times 2 + 1

    Euclid step.

  4. 2 = 2 \times 1 + 0

    Euclid step.

  5. 5 \times 5 = 25 \equiv 1 \pmod{12}

    Back-substitute (extended Euclid) to express 1 as a combination of a and m; the coefficient of a is the inverse.

答えを表示
5^{-1} \equiv 5 \pmod{12}

今度はあなたの番 問題を選択し、タイプしたり描いたりしてください。 すべてのステップは絵で、答えはあなたが尋ねるまで隠されています。

自分の解答を記録しよう

無料アカウントでは、すべてのレッスンにノートを追加し、完成したことの記録、解いた問題を一つの場所に保存し、このページについて質問できる先生を追加します。数学自体はログインしたかどうかに関係なく誰でも利用できます。

登録 ログイン

ここで使用された記号

どの記号をタップしても、定義、画像、それぞれの文字の意味が表示されます。

どうやって: Cyclic groups and permutation groups

  1. We want x with a·x ≡ 1 (mod m). It exists only when gcd(a, m) = 1.
  2. Euclid step.
  3. Euclid step.
  4. Euclid step.
  5. Back-substitute (extended Euclid) to express 1 as a combination of a and m; the coefficient of a is the inverse.

よくある質問

What is a group, in plain words?

A set with one operation that is associative, has an identity, and lets every element be undone. Symmetries of any object form a group. That is where the idea came from.

What is the difference between a ring and a field?

A ring has addition and multiplication that behave like the integers (you cannot always divide); a field is a ring where every non-zero element has a reciprocal, like the rationals or the reals.

More in Abstract Algebra