Is a^i a Generator of F_q If and Only If i and q-1 Are Relatively Prime?

rad0786
Messages
187
Reaction score
0

Homework Statement



Let a be a generator of F_q

Prove that a^i is a generator if & only if i and q-1 are relatively prime.


Homework Equations



a is a generator of F_q means that a^(q-1) = 1 and a^i cannot be 1 for all i not q-1.

relatively prime means that gcd(i,q-1)=1

fermats theorem says that: a^(p-1) = 1 (mod p ) where p is prime

The Attempt at a Solution



=>
Suppose that a^i is a generator of F_q. then a^(i(q-1)) =1 (mod q)

so by fermats theorem, gcd(i, q-1) = 1?

How does that sound?
 
Physics news on Phys.org
Think of the subgroup generated by a^i.
 
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