Show that if G is a group of order np where p is prime and 1< n < p, then G is not simple.
(Please do not use Sylow theorem)
Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!
(Save $1 )
One time Pay
(Save $5 )
Billed Monthly
*First month only
You can see the logs in the Dashboard.