Is n/d the Smallest Order for x^k in Group <x>?

  • Thread starter Thread starter R.P.F.
  • Start date Start date
  • Tags Tags
    Element
R.P.F.
Messages
210
Reaction score
0

Homework Statement


A group <x> has order n. k= nq+r where 0<= r < n. Prove that the order of x^k is n/d where d = gcd (n,k)


Homework Equations





The Attempt at a Solution



I know that (x^k)^(n/d) = 1, but how do I prove that n/d is the smallest one? I tried to assume that (x^k)^(n/d-q) = 1 but could not arrive at any contradiction.

Thank you!
 
Physics news on Phys.org
Let's say x^s = 1, where s < n/d. What must be the relationship between s and n/d?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top