Anki Deck Changes

Commit: d1c0dae1 - change notetypes

Author: obrhubr <obrhubr@gmail.com>

Date: 2025-12-13T20:27:43+01:00

Changes: 3 note(s) changed (0 added, 1 modified, 2 deleted)

Note 1: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID: hx=y:u%$sF
modified

Before

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?


In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]This holds because:

 \(a^m = a^{m + \text{ord}(a)}\)

\( = a^m \cdot a^{\text{ord}(a)}\)

\( = a^m \cdot e = a^m\)

After

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

By what can we reduce the exponent of an element in a finite order Group?


In a group \(G\) of finite order, for \(a \in G\): \[a^m = a^{R_{\text{ord}(a)}(m)}\]This holds because:

 \(a^m = a^{m + \text{ord}(a)}\)

\( = a^m \cdot a^{\text{ord}(a)}\)

\( = a^m \cdot e = a^m\)

Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::5._Cyclic_Groups

Note 2: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: sxW-Trt$`+
deleted

Deleted Note

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function

\(\mathbb{Z}_m^*\) is defined as?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function

\(\mathbb{Z}_m^*\) is defined as?


\[ \overset{\text{def}}{=} \ \{a \in \mathbb{Z}_m \ | \ \gcd(a, m) = 1\} \]

This is the set of all elements in \(\mathbb{Z}_m\) that are coprime to \(m\).

Current

Note has been deleted

Field-by-field Comparison
Field Before After
Text <p>\(\mathbb{Z}_m^*\) is defined as?</p>
Extra <p>\[ \overset{\text{def}}{=} \ \{a \in \mathbb{Z}_m \ | \ \gcd(a, m) = 1\} \]</p> <p>This is the set of all elements in \(\mathbb{Z}_m\) that are coprime to \(m\).</p>
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function

Note 3: ETH::DiskMat

Deck: ETH::DiskMat
Note Type: Horvath Cloze
GUID: G&Y|dtr7^k
deleted

Deleted Note

Front

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function

If the prime factorization of \(m\) is \(m = \prod_{i=1}^r p_i^{e_i}\) then \(\varphi(m)\) is?

Back

ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function

If the prime factorization of \(m\) is \(m = \prod_{i=1}^r p_i^{e_i}\) then \(\varphi(m)\) is?


For a prime and  :\[\varphi(m) = \prod_{i=1}^r (p_i - 1)p_i^{e_i - 1}\]

Current

Note has been deleted

Field-by-field Comparison
Field Before After
Text <p>If the prime factorization of \(m\) is \(m = \prod_{i=1}^r p_i^{e_i}\) then \(\varphi(m)\) is?</p>
Extra <p>For a prime&nbsp;and&nbsp;&nbsp;:\[\varphi(m) = \prod_{i=1}^r (p_i - 1)p_i^{e_i - 1}\]<br></p>
Tags: ETH::1._Semester::DiskMat::5._Algebra::3._The_Structure_of_Groups::8._The_Group_Zₘ*_and_Euler's_Function
↑ Top