Abstract Algebra - Cyclic groups

Click For Summary

Discussion Overview

The discussion revolves around a problem in abstract algebra concerning the order of a group element, specifically related to cyclic groups. Participants are exploring the implications of given orders of powers of a group element and attempting to determine the order of the element itself.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Technical explanation

Main Points Raised

  • One participant presents a problem involving the orders of powers of a group element and attempts to derive the order of the element using properties of gcd and group theory.
  • Another participant calculates gcd(440, 280) = 40 and uses this to argue that the order of the group element must divide 40, listing possible orders as 1, 2, 4, 5, 8, 10, 20, and 40.
  • The same participant rules out several possibilities based on the orders of the powers of the element, suggesting that only 8 and 40 remain as candidates for the order of the element.
  • One participant questions the relevance of starting with gcd(440, 280) = 40, prompting a clarification about minimizing the expression 280x + 440y to find a small number whose order divides it.

Areas of Agreement / Disagreement

Participants express differing levels of understanding regarding the initial steps of the argument, particularly the use of gcd. There is no consensus on the next steps or the final determination of the order of the element.

Contextual Notes

Participants are working with assumptions about the properties of group elements and their orders, but there are unresolved mathematical steps and dependencies on definitions that could affect the conclusions drawn.

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
4K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
12K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
821
  • · Replies 17 ·
Replies
17
Views
9K