This article states and (possibly) proves a fact that involves two finite groups of relatively prime order, requiring the additional datum that at least one of them is solvable. Due to the Feit-Thompson theorem, we know that for two finite groups of relatively prime orders, one of them is solvable. Hence, the additional datum of solvability can be dropped. However, the proof of the Feit-Thompson theorem is considered heavy machinery.
View more such facts
- is a permutably complemented subgroup. In other words, there exists a subgroup such that is trivial and .
- Any two complements to are conjugate subgroups
The second statement does not yet have a direct elementary proof; rather, there is a proof assuming that either or is solvable. However, a well-known corollary of the Feit-Thompson theorem tells us that this is always true.