[a^k] = [a^gcd(n,k)] and |a^k| = n/gcd(n,k) Proof (Abstract Algebra)

Показать описание

🙏Support me by becoming a channel member!

#math #brithemathguy

Disclaimer: This video is for entertainment purposes only and should not be considered academic. Though all information is provided in good faith, no warranty of any kind, expressed or implied, is made with regards to the accuracy, validity, reliability, consistency, adequacy, or completeness of this information. Viewers should always verify the information provided in this video by consulting other reliable sources.

Рекомендации по теме

Комментарии

This is great！help me a lot! I'm so grateful！

jadekan

Bro if I get a teacher like you the I would love it.

gj

Is there a way to show this in a more direct way? Like without the intermediary lemma/theorem? It makes sense why it works, but I wonder if there's something more "efficient".

Thanks a lot for this video, made sense!

kamikamen_official

The gcd theorem is wrong, its should be n=sd and k=td

manhxxo

Can you please help me to prove that
For m>0 : (a^k)^m = e then n/gcd(n, k) <= m

sm-qhzp

[a^k] = [a^gcd(n,k)] and |a^k| = n/gcd(n,k) Proof (Abstract Algebra)

[a^k] = [a^gcd(n,k)] and |a^k| = n/gcd(n,k) Proof (Abstract Algebra)

Abstract Algebra - 4.2 Cyclic Groups and Their Properties a^k=a^gcd(n,k)

o(a)=o(a^k).gcd of n and k | some theorems on order of an element | Bsc/Msc Mathematics | Ravina

Let G be cyclic group of order n then a_k is generator of G if gcd(k, n)=1

Number Theory | Order of a^k mod n

a^(m) is a generator of group G of order n iff GCD(m,n)=1

Let G be group, a ɛ G and O(a)=n. Then for any positive integer k, O(a^k) =n/(n,k).

Let G be cyclic group and a is it's generator. The element a^k is also a generator iff ( k,d)=1

How to Work Through Proofs of Cyclic Group Theorems in Abstract Algebra

Group Theory L-24 |Theorem 4.2|Generator of a^k = Generator of a^gcd(n,k)|Order of a^k = n/gcd(n,k)|

In a Finite Cyclic Group: [a] = [a^j] iff gcd(n,j)=1 Proof (Abstract Algebra)

(NUMBER THEORY) Lecture 22: If k is positive integer then gcd(Ka,kb) = k gcd(a,b)

#Most Important Theorem on Cyclic Group(Algebra) || OU || SEM-IV

#51: Generators of Zn (a finite cyclic group)

for each positive divisor k of n, the group (a) has exactly one subgroup of order k

Cyclic Group | Properties Of Cyclic Group part -3 |Group theory | Modern algebra |

Abstract Algebra, Lec 8B: Cyclic Groups: Empirical Observation of Properties

O(a^k)=O(a)/g.c.d{O(a),k)}

Number Theory | The GCD as a linear combination.

Is binomial(n, k)=0 (mod n) when gcd(n, k)=1? When gcd(n, k)＞1?

Abstract Algebra, Lec 9B: Powers of Cyclic Group Generators, Subgroup Lattice, Permutations

2.2 Cyclic groups continued

CyclicGroupsIII

corollary: Let G be a group and a belongs to G with o(a)=n and if a*k=e then n/k