Burnside’s Lemma is also sometimes known as orbit counting theorem. It is one of the results of group theory. It is used to count distinct objects with respect to symmetry. It basically gives us the formula to count the total number of combinations, where two objects that are symmetrical to each other with respect to rotation or reflection are counted as a single representative.
Therefore, Burnside Lemma’s states that total number of distinct object is:
- c(k) is the number of combination that remains unchanged when Kth rotation is applied, and
- N is the total number of ways to change the position of N elements.
Let us consider we have a necklace of N stones and we can color it with M colors. If two necklaces are similar after rotation then the two necklaces are considered to be similar and counted as one different combination. Now Let’s suppose we have N = 4 stones with M = 3 colors, then
Since we have N stones, therefore, we have N possible variations of each necklace by rotation:
- There are N ways to change the position of necklace as we can rotate it by 0 to N – 1 times.
- There are ways to color a necklace. If the number of rotation is 0, then all ways remains different.
- If the number of rotation is 1, then there in only M necklaces which will be different out of all ways.
- Generally if the number of rotation is K, necklaces will remain sames out of all ways.
Therefore for total number of distinct necklaces of N stones after coloring with M colors is the summation of all the distinct necklaces at each rotation. It is given by:
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.