2011 AMC 12A Problems/Problem 16

Problem

Each vertex of convex polygon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?

$\textbf{(A)}\ 2520 \qquad \textbf{(B)}\ 2880 \qquad \textbf{(C)}\ 3120 \qquad \textbf{(D)}\ 3250 \qquad \textbf{(E)}\ 3750$

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. Similarly, for three of the vertices to have the same color, they have to be three consecutive vertices.

In the first case, the number of ways to color the map is $6 \times 5 \times 4 \times 3 \times 2 = 720$ .

In the second case, the number of ways of coloring is $5 \times (6 \times 5 \times 4 \times 3) = 1800$ .

In the third case, the number of ways of coloring is $5 \times (6 \times 5 \times 4 ) = 600$ .

Total number of colorings is thus $3120 \rightarrow \boxed{\textbf{C}}$

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

Page

Toolbox

Search

2011 AMC 12A Problems/Problem 16

Problem

Solution

See also