Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2010-10-17 11:51:45

sam123
Guest

group theory proof

Let G be a finite cyclic group of order n, and let g E G such that |g| = n. Prove that the elsements 1,g,g^2,...,g^n-1 are distinct. Deduce that g is a generator for G.

(where E means g is an element of G!)

Getting stuck with this one, any help would be greatly appreciated, cheers!

#2 2010-10-18 04:22:30

Bob
Administrator
Registered: 2010-06-20
Posts: 10,583

Re: group theory proof

Hi sam123

I think you could assume g^i = g^j where i and j are not equal.  Say i > j.  Times g^i by enough 'g's to make it into the identity and the other by the same.  You've got a contradiction as you now have an power of 'g' below 'n' that is the identity.  So no two are the same.

That means you've got 'n' distinct elements so you got them all => g has generated them all.

Bob


Children are not defined by school ...........The Fonz
You cannot teach a man anything;  you can only help him find it within himself..........Galileo Galilei
Sometimes I deliberately make mistakes, just to test you!  …………….Bob smile

Offline

Board footer

Powered by FluxBB