Finite group of even order has elements of order 2

1MileCrash
Messages
1,338
Reaction score
41
[The homework format does not appear on mobile]

Problem: Show that a finite group of even order has elements of order 2

Attempt:
The book gives a suggested approach that lead me to write the most round about, ugly proof I've ever written.

Can't I just say:
1.) If G has even order, G/{1} has odd cardinality.
2.) Assume that no elements of G/{1} has order 2.
3.) Then for each x in G/{1}, x^-1 is a distinct element of G/{1}.
4.) Then G/{1} has even cardinality.
Contradiction
5.) Therefore, there exists a y in G/{1} such that y = y^-1, and thus has order 2.
 
Physics news on Phys.org
1MileCrash said:
[The homework format does not appear on mobile]

Problem: Show that a finite group of even order has elements of order 2

Attempt:
The book gives a suggested approach that lead me to write the most round about, ugly proof I've ever written.

Can't I just say:
1.) If G has even order, G/{1} has odd cardinality.
2.) Assume that no elements of G/{1} has order 2.
3.) Then for each x in G/{1}, x^-1 is a distinct element of G/{1}.
4.) Then G/{1} has even cardinality.
Contradiction
5.) Therefore, there exists a y in G/{1} such that y = y^-1, and thus has order 2.

That is the standard method of showing that a finite group of even order has an element of order 2.
 
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