INTRODUCING 5 - days-a-week problem solving session for Math Olympiad and ISI Entrance. Learn More 

December 10, 2017

Groups with no subgroups

Claim: If G has no subgroups H /= (e), G, then G must be cyclic of prime order.


Proof: 

One Line Proof: If the order of G is composite, then it has Sylow Subgroups.

More than one Line Proof: If the order of G is composite then there exists d that divides |G| and 1 < d < |G|. Pick any element from G. Note that ( g^d \neq e ) otherwise we will find a nontrivial subgroup. Then consider the non-trivial subgroup generated by ( g^d ). As  ( g^{d \times \frac{|G|}{d} } = e ) hence we find a non trivial subgroup.

Therefore the order of G cannot be composite.

Rest is left as an exercise.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Cheenta. Passion for Mathematics

Advanced Mathematical Science. Taught by olympians, researchers and true masters of the subject.
JOIN TRIAL
support@cheenta.com