Abstract Algebra - Cyclic groups

Click For Summary
SUMMARY

The discussion centers on determining the order of a group element \( |a| \) given the conditions \( |a^{28}| = 10 \) and \( |a^{22}| = 20 \). The key equations used are \( |a^k| = n/\gcd(n,k) \), leading to the conclusion that \( n \) must divide 40. After analyzing possible divisors, the valid candidates for \( |a| \) are narrowed down to 8 and 40, with further deductions ruling out 8 based on the order of \( a^{28} \). The final conclusion is that \( |a| = 40 \).

PREREQUISITES
  • Understanding of group theory concepts, specifically cyclic groups.
  • Familiarity with the properties of orders of group elements.
  • Knowledge of the greatest common divisor (gcd) and its application in group theory.
  • Ability to manipulate algebraic expressions involving group elements.
NEXT STEPS
  • Study the properties of cyclic groups in abstract algebra.
  • Learn about the application of gcd in determining orders of group elements.
  • Explore the implications of element orders in finite groups.
  • Investigate the structure of groups and subgroup orders in relation to Lagrange's theorem.
USEFUL FOR

Students studying abstract algebra, particularly those preparing for exams in group theory, and anyone interested in the properties of cyclic groups and their orders.

basketm19
Messages
2
Reaction score
0
1. Problem: Suppose a is a group element such that |a^28| = 10 and |a^22| = 20. Determine |a|.

I was doing some practice problems for my exam next week and I could not figure this out. (This is my first post on PF btw)

2. Homework Equations : Let a be element of order n in group and let k be a positive integer. Then <a^k> = <a^gcd(n,k)> and |a^k| = n/gcd(n,k).

3. Attempt at solution:

10 = n/gcd(n, 28); 20 = n/gcd(n, 22)

Setting n equal to each other, 10gcd(n, 28) = 20gcd(n,22)

gcd(n, 28) = 2gcd(n, 22)

The possible values for n are 4, 8, 12, 16, 20, 24, ... , so on.

Not sure where to go from here.
 
Physics news on Phys.org
gcd(440,280) = 40.

this means we can find integers a,b with

440a + 280b = 40, that is

11a + 7b = 1. a = 2, b = -3 will work.

thus a^40 = (a^(880))(a^-(840))

= (a^(440))^2(a^(280))^(-3)

= ((a^22)^20)^2((a^28)^10)^(-3)

= e^2(e^-3) = ee = e.

that means |a| divides 40, which gives us just 1,2,4,5,8,10,20 and 40 as possibilities.

since a^28 ≠ e, we can rule out 1,2, and 4 as possibilities.

suppose a^5 = e. then a^28 would have order 5,

since (a^28)^5 = (a^5)^28. similarly, we can rule out

every divisor of 10 and 20, leaving just 8 and 40.

so suppose |a| = 8.

then (a^28)^2 = a^56 = (a^8)^7 = e, but |a^28| = 10.

what's left?
 
Thanks for the response. But I don't understand why you are starting out with gcd(440,280) = 40.
 
basketm19 said:
Thanks for the response. But I don't understand why you are starting out with gcd(440,280) = 40.

We know that the order of a^{28} is 10. So a^{280}=e. Similarly, we know that a^{440}=e.

For each integers x and y, it follows that a^{280x+440y}=e. We wish to minimize 280x+440y (since this will be a small number such that the order divides this number). The minimal number is exactly gcd(280,440). This is why he started by this.
 

Similar threads

  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 26 ·
Replies
26
Views
931
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
11K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
609
  • · Replies 17 ·
Replies
17
Views
9K