# Generator (number theory)

1. Oct 30, 2007

1. The problem statement, all variables and given/known data

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.

2. Relevant 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

3. 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?

2. Oct 31, 2007

### zhentil

Think of the subgroup generated by a^i.