Let me write the proof here now. The following is variation of Sylow's theorem. I claim the following: Suppose that p is prime. If $p^m$ divides |G|, then G has a subgroup of order $p^m$.
Proof: It is true for |G|=1, 2. If m=1, then the result follows by Cauchy's theorem so assume that m>1. We'll use induction on |G|. So suppose the statement to be true for all groups with order < |G|. Now, if G has a proper subgroup H s.t. $p^m$ divides |H|, then by the induction hypothesis, H has a subgroup K of order $p^m$, hence $K\le G$.