No problem! Keep working at it and it will become second nature.

In summary: Yes, I'm aware of this fact - I proved it in another exercise. I'm still a bit new to group theory, so I don't realize some things right away yet. :smile:
  • #1
radou
Homework Helper
3,149
8

Homework Statement



Let G be a group, and a an element of G of order m. What is the order of a^k?

The Attempt at a Solution



Well, first of all, if (a^k)^p = e, for some p, we have kp = mq, for some q. Now, for some k, the order of a^k is the least such p. Hence, it would make to sense to consider the least common multiple of k and m, lcm(m, n). The lcm(m, n)/k is the order of a^k. This is a bit informal perhaps, but it seems clear to me. Is this correct?
 
Physics news on Phys.org
  • #2
Further on, it would follow from this that the powers of a which have the same order as a are those such that the least common multiple of k and m equals km.
 
  • #3
Seems clear to me too. But you meant lcm(m,k), right? There's no 'n' in the problem.
 
  • #4
Dick said:
Seems clear to me too. But you meant lcm(m,k), right? There's no 'n' in the problem.

Oh, sorry, it was a typo - yes, I meant lcm(m, k). Thanks.
 
  • #5
radou said:
Further on, it would follow from this that the powers of a which have the same order as a are those such that the least common multiple of k and m equals km.

And if lcm(k,m)=km that tells you something about gcd(k,m).
 
  • #6
Dick said:
And if lcm(k,m)=km that tells you something about gcd(k,m).

Well, integers k, m such that lcm(k, m) = km tells us that k and m are relatively prime, hence gcd(k, m) = 1... I don't see a fact which follows from this right away.
 
  • #7
radou said:
Well, integers k, m such that lcm(k, m) = km tells us that k and m are relatively prime, hence gcd(k, m) = 1... I don't see a fact which follows from this right away.

Nothing you haven't already said. But the phrasing most people would use is that a^k generates the whole group if k and m are relatively prime.
 
  • #8
Dick said:
Nothing you haven't already said. But the phrasing most people would use is that a^k generates the whole group if k and m are relatively prime.

Yes, I'm aware of this fact - I proved it in another exercise. I'm still a bit new to group theory, so I don't realize some things right away yet. :smile:
 

FAQ: No problem! Keep working at it and it will become second nature.

What are "orders of group elements"?

"Orders of group elements" refer to the number of elements in a particular group, or collection, of elements. This number is typically denoted as |G|, where G is the group.

How are orders of group elements determined?

The order of a group is determined by counting the number of elements in the group. This can be done by listing out all the elements in the group or by using mathematical formulas specific to certain types of groups.

Why are orders of group elements important?

Orders of group elements are important because they provide information about the structure and properties of a group. They can also be used to classify groups and determine their relationship to other groups.

Can the order of a group element change?

Yes, the order of a group element can change if new elements are added to the group or if elements are removed. However, the order of a group itself remains constant.

Are there any specific patterns or rules for determining the order of group elements?

Yes, there are various patterns and rules for determining the order of group elements depending on the type of group. For example, in cyclic groups, the order of an element must be a factor of the order of the group. In symmetric groups, the order of an element can be calculated using factorials.

Similar threads

Back
Top