Difference between revisions of "2011 AMC 12A Problems/Problem 16"

Revision as of 13:40, 13 December 2020

Problem

Each vertex of convex pentagon $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

We can do some casework when working our way around the pentagon from $A$ to $E$ . At each stage, there will be a makeshift diagram.

1.) For $A$ , we can choose any of the 6 colors.

        A : 6

2.) For $B$ , we can either have the same color as $A$ , or any of the other 5 colors. We do this because each vertex of the pentagon is affected by the 2 opposite vertices, and $D$ will be affected by both $A$ and $B$ .

      A : 6
 B:1        B:5

3.) For $C$ , we cannot have the same color as $A$ . Also, we can have the same color as $B$ ( $E$ will be affected), or any of the other 4 colors. Because $C$ can't be the same as $A$ , it can't be the same as $B$ if $B$ is the same as $A$ , so it can be any of the 5 other colors.

      A : 6
 B:1        B:5
 C:5     C:4   C:1

4.) $D$ is affected by $A$ and $B$ . If they are the same, then $D$ can be any of the other 5 colors. If they are different, then $D$ can be any of the (6-2)=4 colors.

      A : 6
 B:1        B:5
 C:5     C:4   C:1
 D:5     D:4   D:4

5.) $E$ is affected by $B$ and $C$ . If they are the same, then $E$ can be any of the other 5 colors. If they are different, then $E$ can be any of the (6-2)=4 colors.

      A : 6
 B:1        B:5
 C:5     C:4   C:1
 D:5     D:4   D:4
 E:4     E:4   E:5

6.) Now, we can multiply these three paths and add them: $(6\times1\times5\times5\times4)+(6\times5\times4\times4\times4)+(6\times5\times1\times4\times5) =600+1920+600=3120$

7.) Our answer is $C$ !

Solution 2

Right off the bat, we can analyze three things:

1.) There can only be two of the same color on the pentagon.

2.) Any pair of the same color can only be next to each other on the pentagon.

3.) There can only be two different pairs of same colors on the pentagon at once.

Now that we know this, we can solve the problem by using three cases: no same color pairs, one same color pair, and two same color pairs.

1.) If there are no color pairs, it is a simple permutation: six different colors in five different spots. We count $6!=720$ cases. No rotation is necessary because all permutations are accounted for.

2.)If there is one color pair, we must count 6 possibilities for the pair(as one element), 5 for the third vertex, 4 for the fourth vertex, and 3 for the fifth vertex.

We get $6\times5\times4\times3=360$ .

However, there are 5 different locations the pair could be at. Therefore we get $360\times5=1800$ possibilities for one pair.

3.)If there are two color pairs, we must count 6 possibilities for the first pair(as one element), 5 possibilities for the next pair(as one element), and 4 possibilities for the final vertex.

We get $6\times5\times4=120$ .

Once again, there are 5 different rotations in the pentagon that we must account for. Therefore we get $120\times5=600$ possibilities for two pairs.

5.) If we add all of three cases together, we get $720+1800+600=3120$ . The answer is $C$ .

Solution by gsaelite

Video Solution

https://youtu.be/FThly7dRBIE

~IceMatrix

@@ Line 84: / Line 84: @@
 Solution by gsaelite
-==Solution 3==
-Break up the pentagon and imagine creating a "necklace" out of the diagonals with sequence <math>A-D-B-E-C-A</math>.
-We wish to determine all possible necklaces, or strings, such that <math>A,D,B,E</math> and <math>C</math> are all different colors.
-Let <math>F_{n}</math> denote the number of ways to color a necklace with <math>n</math> total characters.
-We wish to determine <math>F_{5}</math>
-<math>\text{Claim}</math>: For <math>n\ge{3}</math>, we have
-<math>F_{n}=6(5)^{n-1}-F_{n-1}</math> for <math>n\ge{3}</math>
-<math>\text{Proof}</math>:
-Consider a string of length <math>n</math>. The very first letter can be colored in <math>6</math> ways. The rest of the <math>n-1</math> letters can be colored in <math>5</math> ways.
-However, we may run into the case where the first and last characters are the same color.
-Imagine "merging" these characters into one. Realize that this new "necklace" is simply a new distinct string, or one of length <math>n-1</math>. These are all the "bad" cases.
-Putting it all together,
-<math>F_{n}=6(5)^{n-1}-F_{n-1}</math> for <math>n\ge{3}</math>
-Now, the rest is simple computation.
-<math>F_{1}=6</math>
-<math>F_{2}=6\cdot{5}=30</math>
-<math>F_{3}=6\cdot{5}\cdot{4}=120</math>
-<math>F_{4}=6\cdot{5}^{3}-120=630</math>
-<math>F_{5}=6\cdot{5}^{4}-630=\boxed{3120}</math>
-Solution by Pi_3.14_Squared
 ==Video Solution==

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