1. **Problem Statement:** Explain Cauchy's theorem at an IMO (International Mathematical Olympiad) level. 2. **What is Cauchy's Theorem?** In group theory, Cauchy's theorem states that if a finite group $G$ has order divisible by a prime number $p$, then $G$ contains an element of order $p$. 3. **Formula and Key Idea:** If $p$ divides $|G|$ (the order of $G$), then there exists $g \in G$ such that $g^p = e$ and $g^k \neq e$ for $1 \leq k < p$, where $e$ is the identity element. 4. **Important Rules:** - The order of an element $g$ is the smallest positive integer $m$ such that $g^m = e$. - The order of a subgroup divides the order of the group (Lagrange's theorem). 5. **Proof Sketch:** - Consider the set of all $p$-tuples $(x_1, x_2, ..., x_p)$ in $G^p$ such that $x_1 x_2 ... x_p = e$. - Use group actions or counting arguments to show existence of an element of order $p$. 6. **Explanation:** - Since $p$ divides the size of $G$, the group structure forces the existence of an element whose repeated application cycles back to the identity after exactly $p$ steps. - This element generates a cyclic subgroup of order $p$. 7. **Summary:** Cauchy's theorem guarantees that prime divisors of the group order correspond to elements of that prime order, a fundamental result in finite group theory. Final answer: Cauchy's theorem states that if a prime $p$ divides the order of a finite group $G$, then $G$ contains an element of order $p$.