Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I want to show without using Sylow theorem that

Any group of order $2p$ has a subgroup of order $p~$($p$ being a prime)

My attempt: Since $|G|=2p,$ even $\exists~a\neq e\in G$ such that $a^{-1}=a.$ Then $H=\{e,a\}\leq G.$ Let $S$ be the set of all left cosets of $H$ in $G.$ Now $S$ forms a group w.r.t. the composition $g_1Hg_2H=(g_1g_2)H.$ The mapping $\sigma:S\to G:gH\mapsto g$ is an $1-1$ homomorphism. Then $S\simeq\sigma(S)\leq G.$ Thus $G$ has a subgroup of order $p.$

Please tell me whether I'm right!

I'm skecptical as I didn't use that $p$ is prime.

share|cite|improve this question
Two problems in your attempt. 1) The multiplication of cosets of $H$ is not always well defined. 2) The mapping $\sigma$ is not well defined. – Jyrki Lahtonen Apr 13 '13 at 7:25
Thanks so much. – Sriti Mallick Apr 13 '13 at 7:33
up vote 6 down vote accepted

We only need to consider the case that $p$ is odd.If there is no element of order $p$ in the group, then every non-identity element of the group has order $2$. But a group in which every non-identity element as order $2$ is Abelian: ($1 = abab,$ so $aba = b$ and $ba = ab).$ The group has more than one subgroup of order $2,$ so since it is Abelian, it has a subgroup of order $4,$ contrary to Lagrange's theorem.

share|cite|improve this answer

Write $G$ for the group. If $G$ is cyclic, let $g$ be a generator, and we have that $g^2$ has order $p$. Otherwise, note that $G$ is solvable by Burnside's theorem. The only simple solvable groups are cyclic of order $p$, so we may write $1\lhd N \lhd G$. If $N$ has order $p$, we're done. If $N$ has order $2$, then take a nontrivial element $xN$ in $G/N$. Then $o(xN)$ divides $o(x)$, but $G$ is not cyclic, so it follows that $o(x)=p$.

share|cite|improve this answer

By cauchy's theorem for every prime dividing order of the group there exists an element of order p. proof of cauchy's theorem requires no sylow theorems. consider the subgroup generated by that element to get a subgroup of order n.

share|cite|improve this answer

First why that subgroup of order two is normal? every group of order 2p need not have a normal subgroup of order 2. Consider $S_3$. So in your proof S need not form a group in general under coset product.

share|cite|improve this answer

Why the set of left cosets of $H$ forms a group ? The question is a special case of Every group has a subgroup of prime order?

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.