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.

에 더 Abstract Algebra