If this a duplicate question than I apologize.
How would you prove Euler's theorem using combinatorics? The theorem goes:
$x^{\phi(n)}\equiv 1 \pmod n$ where $(x, n)=1$
I can only come up with proofs for this related to number theory. Any hints or advice?