Connection between Fermat’s Little Theorem and Circular Permutations

There is a simple connection between Fermat’s Little Theorem and Circular Permutation. It can be summarized as number of ways to make an a bead ring with p colors. So that none of the ring has all the beads of the same color. The number of beads has to be prime. Which mathematically boils down to p|a^p-a or a^p \equiv a \mod p.

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Abstract Algebra, Number Theory, Proof, Proof by Construction and tagged . Bookmark the permalink.

Leave a comment