Need Help with Abstract Algebra Please

Click For Summary

Discussion Overview

The discussion revolves around the properties of a 10-cycle in abstract algebra, specifically focusing on determining which integers \( i \) between 2 and 10 result in \( B^{(i)} \) also being a 10-cycle. The scope includes mathematical reasoning and proof techniques related to group theory.

Discussion Character

  • Mathematical reasoning
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant asserts that the integers \( i \) must be coprime with 10 for \( B^{(i)} \) to also be a 10-cycle.
  • A general proof is provided, explaining that if an element \( g \) has order \( n \), then \( g^i \) has order \( \frac{n}{} \), where \( \) is the greatest common factor of \( n \) and \( i \).
  • Another participant expresses gratitude for the explanation and indicates improved understanding.
  • A different viewpoint is raised, questioning whether having order 10 guarantees that \( g \) is a 10-cycle, suggesting that \( g \) could be a product of disjoint cycles of orders 2 and 5, which would also yield an order of 10.

Areas of Agreement / Disagreement

Participants express differing views on the implications of an element having order 10, with some agreeing on the coprimality condition while others challenge the assumption that order alone determines cycle structure.

Contextual Notes

The discussion includes assumptions about the definitions of cycles and orders in group theory, which may not be universally agreed upon. The proof provided relies on specific mathematical properties that may require further clarification or context.

Redhead711
Messages
10
Reaction score
0
My question is regarding abstract algebra.

Suppost that B is a 10-cycle.
For which integers i between 2 and 10 is
B^(i) also a 10-cycle?

I know that the answer is 3, 7, and 9 I just don't know
how you arrive at these numbers. If someone could explain the
process clearly to me I would greatly appreciate that.
Thank you sooo much. :-)
 
Physics news on Phys.org
The [tex]i[/tex] are values that are coprime (have no common factors other than 1) with 10.

Here's a general proof:

Let's say we have some element [tex]g[/tex] with order [tex]n[/tex]. Then [tex]g^i[/tex] has order [tex]\frac{n}{<n,i>}[/tex] where [tex]<n,i>[/tex] is the greatest common factor of [tex]n[/tex] and [tex]i[/tex].

Proof:
[tex]({g^{i}})^{\frac{n}{<n,i>}}=g^{i \times \frac{n}{<n,i>}}[/tex]
but
[tex]i = k \times <n,i>[/tex]
for some [tex]k[/tex] so
[tex]g^{i \times \frac{n}{<n,i>}}=g^{k \times <n,i> \times \frac{n}{<n,i>}}=g^{k \times n}=g^{n\times k}=(g^{n})^{k}=e^k=e[/tex]
so the order ok [tex]g{i}[/tex] is at most [tex]\frac{n}{<n,i>}[/tex]

Now, let's say we have some [tex]j[/tex] so that
[tex]e=({g^{i}})^j=g^{ij}[/tex]
then, since the order of [tex]g[/tex] is [tex]n[/tex]
so [tex]n | ij[/tex] ([tex]n[/tex] divides [tex]ij[/tex])
so [tex]\frac{n}{<n,j>} | j \Rightarrow j \geq \frac{n}{<n,i>}[/tex]

So the order of [tex]g^i[/tex] is [tex]\frac{n}{<n,i>}[/tex].

In this particular case, you have [tex]\frac{n}{<n,i>} = n[/tex] so [tex]<n,i>=1[/tex].
 
Thank you so much I understand much better now. I am very grateful for all your help.
 
I think that g has order 10 does not guarantee that g is a 10-cycle. If g is a product of two disjoint cycles of order 2 and 5, it can still have order 10. Is that right?
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 25 ·
Replies
25
Views
5K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K