A theorem of Frobenius states that if $n$ divides the order of a finite group $G$, then the number of solutions to $x^n = 1$ in $G$ is a multiple of $n$. Frobenius conjectured that if the number of solutions is exactly $n$, then the set of solutions form a characteristic subgroup of $G$. The conjecture was eventually proved in the 90's, and the full proof uses the classification of finite simple groups.

The theorem feels a bit isolated for me.. I'm not sure how the conjecture fits into a wider context, either. What is their importance, if any? Are there any good examples of applications of the theorem or the conjecture? If I'm interested in finite groups, why should I care about the theorem or the conjecture, other than that they are kind of neat?

One example I know is that if $G$ has every Sylow subgroup cyclic, then with Frobenius theorem we can show that the Sylow subgroup corresponding to the largest prime divisor of $G$ is normal. Also (this one is too easy, but I like it) for any prime $p$, the number of elements satisfying $x^p = 1$ in the symmetric group $S_p$ is $(p-1)! + 1$, so Frobenius theorem implies $(p-1)! \equiv -1 \mod p$.