p equal sectors, where p is prime, and colored with n colors. Two colorations which can be deduced one from the other by rotating the disk around its center in some direction, are not considered distinct. We can use the same color in all sectors. In how many ways can this be done? For answering, take n = 4 and p = 3
Let a disk be divided inThis problem was inspired on some USSR Olympiad problems
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The colorations can only involve 1, 2 or 3 colors for the 3 sectors of the disk. We need to find the sum of the numbers of colorations for 1, 2 and 3 colors.
s = n 1 + n 2 + n 3
For 1 color, there are only 4 possible colorations. The number of colarations,
n 1 = 4
For 2 colors, it involves the number of ways or combinations you can choose 2 colors out of 4. And for each combination, there are two colorations with one color occupies one sector and the other occupies two sectors. Therefore,
n 2 = 2 C 2 4 = 1 2
For 3 colors, again for each of the combinations you choose 3 colors out of 4, there are two colorations with two of the colors swap sectors. Therefore,
n 3 = 2 C 3 4 = 8
Therefore the answer is
s = n 1 + n 2 + n 3 = 4 + 1 2 + 8 = 2 4
Problem Loading...
Note Loading...
Set Loading...