Difference between revisions of "2011 AMC 12A Problems/Problem 16"
(→Solution) |
(→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Each vertex of convex | + | Each vertex of convex pentagon <math>ABCDE</math> is to be assigned a color. There are <math>6</math> colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible? |
<math> | <math> | ||
Revision as of 16:32, 30 June 2011
Problem
Each vertex of convex pentagon 
is to be assigned a color. There are 
colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
Solution
There are three cases to consider altogether: all the vertices have different colors, two of the vertices have the same color while the rest have different colors, and three of the vertices have the same color while the rest are all different..
When two of the vertices are of the same color, they have to be two consecutive vertices. For three of the vertices to have the same color, two pairs of two consecutive vertices must be the same color while one is a different color.
In the first case, the number of ways to color the map is 
.
In the second case, the number of ways of coloring is 
.
In the third case, the number of ways of coloring is 
.
Total number of colorings is thus 
See also
| 2011 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 15 |
Followed by Problem 17 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
