In how many ways can we color the 9 rectangles in the flag below using only the colors green, white, and yellow, such that each color covers 3 1 of the flag?
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.
Can you explain the bijection of "coloring the flag" with "arrange the letters"?
Log in to reply
Done. Does it make sense?
Let's start using the Yellow color, to paint the flag. The yellow color should appear in 3 small rectangles. These rectangles can be any of the 9 rectangles. How there are no differences between the rectangles, the number of ways that we can choose 3 rectangles between 9 without repetitions is:
( 3 9 ) = 3 ! ( 9 − 3 ) ! 9 ! = 8 4
Now let's use the Green color.
How there are left six rectangles to paint, the number of ways that we can choose 3 rectangles from it is:
( 3 6 ) = 3 ! ( 6 − 3 ) ! 6 ! = 2 0
Now there are left 3 rectangles left. These rectangle will recieve the last colour (White). Not matter the way that we paint the flag, always will be left 3 rectangles. Then the number of ways that we can paint this flag is: 8 4 × 2 0 = 1 6 8 0 .
Same way here :)
Problem Loading...
Note Loading...
Set Loading...
This is similar to the number of ways you can arrange the letters in the word AAABBBCCC, for which the solution is:
3 ! 3 ! 3 ! 9 ! = 1 6 8 0
The reason they are essentially the same question, is that if each of the letters corresponds to one of the colors (e.g. A=green, B=white, C=yellow) and each of the positions of the letters corresponds to the one of the squares in the flag, then we have a 1:1 mapping of the solutions of the flag problem to the rearrangements of AAABBBCCC.