I'm trying to show that if $G$ is a group of order $20$, then it will have an element of order $10$.
Considering the Sylow $5$-subgroups, we have $n_5 \equiv 1 \mod 5$ and $n_5 | 4$, so $n_5=1$ and so we have one cyclic subgroup of order $5$ and thus $4$ elements of order $5$.
Similarly, $n_2 \equiv 1 \mod 2$ and $n_2|5$ so $n_2=1$ or $5$. If we have $n_2 = 5$ then we can have at most $5 \cdot 3 = 15$ elements of order $2$ in the group, which would occur if the Sylow $2$-subgroups are disjoint copies of $C_2 \times C_2$.
In this case, alongside the identity, we have accounted for all $1+4+15=20$ elements and we don't have an element of order $10$. Otherwise we have elements of order $10$ and $20$ and we are done.
So, I am wondering how (if?) we can rule out this one particular case, or if there is a better method for showing that there must be an element of order $10$.
The Frobenius group of order $20$, which arises as the Galois group of $X^5-2$ over $\Bbb Q$, is a subgroup of $S_5$, i.e., generated by $(12345)$ and $(1243)$. It is isomorphic to the semidirect product $C_5\rtimes C_4$. Since $S_5$ has no element of order $10$, it has no element of order $10$ either.
However, since all groups of order $20$ are supersolvable, they satisfy the converse of Lagrange: since $10$ divides $20$, there is a subgroup of order $10$ in all cases. For CLT-groups (converse Lagrange groups) see here:
Complete classification of the groups for which converse of Lagrange's Theorem holds