Fermat's little theorem states that for prime , we have Here is a proof:
- Consider and
- They are permutations of each other under
However, when we are talking about a composite number , we have for coprime integers and instead, from Euler's theorem.
If I use the above proof flow for the Euler's theorem, in which step do I first make a mistake?