Must a Non-Abelian Group of Order 10 Have an Element of Order 2?

Bds_Css
Messages
4
Reaction score
0

Homework Statement



Prove that a non-abelian group of order 10 must have an element of order 2.



What if the order of every element is 5?
Prove there are 5 elements of order 2.
 
Physics news on Phys.org


Where is your working? Have you attempted this?
 


honestly, I have no work because I don't know where to begin
 


Bds_Css said:
What if the order of every element is 5?
Prove there are 5 elements of order 2.

I don't know what you mean by this but for the first part use Lagrange's theorem deduce that there are 2 possible orders of elements. If you assume there is no element of order 2 prove that this means the group is abelian.
 


sorry,
it is all one problem


Prove that a nonabelian group of order 10 must have an element of order 2. What if the order of every element is 5? Prove there are 5 elements of order 2.


I am having trouble understanding Lag. THM.

Thanks again for your help
 


Lagranges theorem says that the order of the subgroup must divide the order of the group. The order of a cyclic group is prime. If you take any element of the group, you can make a cyclic subgroup generated by that element, so Lagrange says that the order of any element must divide the order of the group. The two possibilities you have for a non identity element are 2 and 5.
 
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