I've been studying Sylow-$p$ subgroups, and I've come across this problem.
Let $G$ be a finite group. Show that the number of Sylow subgroups of $G$ is at most $\frac{2}{3}|G|$ . ($|G|$ is the number of elements of $G$).
I am having trouble figuring this one out, I was wondering if anyone could help?
Possibly a partial answer - we first consider a particular prime and then we prove something slightly stronger.
Let $p$ be a prime dividing the order of the group $G$. Now it is standard that $n_p:=|Syl_p(G)|=[G:N_G(P)]$. But $P \subseteq N_G(P)$ and certainly $|P| \geq p$, implying $|N_G(P)| \geq p$. Hence $n_p \leq \frac{1}{p}|G| \leq \frac{1}{2}|G|$.
Corollary Let $|G|=p^aq^b$, with $p$ and $q$ prime numbers and $p \lt q$ and $a$ and $b$ positive integers.
(1) If $p=2$ and $q \geq 7$, then the total number of Sylow subgroups of $G$ is smaller than $\frac{2}{3}|G|$.
(2) If $p$ is odd, then then the total number of Sylow subgroups of $G$ is smaller than $\frac{2}{3}|G|$.
Proof Apparently, the total number of Sylow subgroups of $G$ equals $n_p + n_q \leq (\frac{1}{p}+\frac{1}{q})|G|$. In case (1) we have $(\frac{1}{2}+\frac{1}{q})|G| \lt \frac{2}{3}|G|$, since $q \gt 6$. In case (2) $(\frac{1}{p}+\frac{1}{q})|G| \leq (\frac{1}{3}+\frac{1}{5})|G| \lt \frac{2}{3}|G|. \square$
Note: this principle can be further generalized to more prime factors, for example if $|G|=p^aq^br^c$, with $5 \leq p \lt q \lt r$, the bound of $\frac{2}{3}|G|$ still holds.