Show that for any integer m>1, a^m≡a^(m-φ(m))mod(m).Help
For any integer m>1,φ(m) is the number of integers not greater than m and are relatively prime to m.I think I can re frame my question if you don't understand the former;For any integer m>1,show that m divides a^m-a^(m- φ(m)) for all integers a.