This question is from the counting principle section of my abstract algebra textbook. I understand the proof that is provided in my textbook. The proof uses a counterexample with subgroups $H$ and $K$ to get a contradiction with $o(H\cap K)=o(H)=o(K)$. I was wondering if this was an alternative proof.
Suppose there are two subgroups with order $p$. We know that $$o(H\cap K)\ge\frac{o(H)o(K)}{o(G)}>1$$
The middle equation would be $\frac{p^2}{pq}=\frac{p}{q}$. Since $p$ is a prime and $p>q$, $\frac{p}{q}$ wouldn't be an integer.
If I am wrong, I think I am incorrectly assuming that $\frac{p}{q}$ has to be an integer, but it feels like it has to, intuitively.