# Groups whose orders have no common factors

1. Nov 3, 2008

### SNOOTCHIEBOOCHEE

1. The problem statement, all variables and given/known data
Let G and G' be finite groups whose orders have no common factor. Prove that the homomorphism $$\varphi$$ G $$\rightarrow$$ G' is the trivial one $$\varphi$$ (x) =1 for all x.

3. The attempt at a solution

My thoughts are that we need to use lagrange's thm. somehow. or maybe not.

We have the order of G and G' such that. GCD( |G|, |G'|) =1.

$$\varphi$$ G $$\rightarrow$$ G'

Let |G| = n

By legranges thm.

gn $$\in$$ G = 1G

and we know that $$\varphi$$ (gn)= 1G'

But i dont really no what to do from here. It doesnt seem as if i am on the right track.

Any thoughts?

2. Nov 3, 2008

### HallsofIvy

Staff Emeritus
I presume you mean prove that the only homomorphism from G to G' is $\phi(g)= 1_{G'}$. Let x be a member of G, not equal to 1G. Let n be the order of x: the smallest integer n such that xn= 1G. What is the order of $\phi(x)$?

3. Nov 3, 2008

### SNOOTCHIEBOOCHEE

The order of $$\varphi(x)$$ must divide n.

4. Nov 3, 2008

### HallsofIvy

Staff Emeritus
But the order of any member of member of G must divide |G|. Since the order $\phi(x)$ divides n, it also divides |G|. And the order of $\phi(x)$ must, like the order of any member of G', must divide |G'|. What is the only number that divides both |G| and |G'|?

5. Nov 3, 2008

### SNOOTCHIEBOOCHEE

Holy crap youre my hero.