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

Click For Summary
SUMMARY

The discussion centers on the mathematical proof that a^i is a generator of the finite field F_q if and only if the integers i and q-1 are relatively prime. It is established that if a is a generator of F_q, then a^(q-1) = 1 and a^i cannot equal 1 for any i not equal to q-1. The proof utilizes Fermat's theorem, which states that a^(p-1) = 1 (mod p) for a prime p, leading to the conclusion that gcd(i, q-1) must equal 1 for a^i to also be a generator.

PREREQUISITES
  • Understanding of finite fields, specifically F_q
  • Knowledge of generators in group theory
  • Fermat's Little Theorem and its implications
  • Concept of greatest common divisor (gcd)
NEXT STEPS
  • Study the properties of finite fields and their generators
  • Explore advanced topics in group theory related to cyclic groups
  • Learn about applications of Fermat's theorem in number theory
  • Investigate the implications of gcd in modular arithmetic
USEFUL FOR

This discussion is beneficial for mathematicians, students studying abstract algebra, and anyone interested in number theory and finite fields.

rad0786
Messages
187
Reaction score
0

Homework Statement



Let a be a generator of [tex]F_q[/tex]

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


Homework Equations



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

relatively prime means that [tex]gcd(i,q-1)[/tex]=1

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

The Attempt at a Solution



=>
Suppose that [tex]a^i[/tex] is a generator of [tex]F_q[/tex]. 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.
 

Similar threads

Replies
30
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
2K
Replies
15
Views
4K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K