University of South Carolina High School Math Contest/1993 Exam/Problem 19

Revision as of 13:15, 23 July 2006 by Joml88 (talk | contribs)

Problem

In the figure below, there are 4 distinct dots $A, B, C,$ and $D$, joined by edges. Each dot is to be colored either red, blue, green, or yellow. No two dots joined by an edge are to be colored with the same color. How many completed colorings are possible?

Usc93.19.PNG
$\mathrm{(A) \ }24 \qquad \mathrm{(B) \ }72 \qquad \mathrm{(C) \ }84 \qquad \mathrm{(D) \ }96 \qquad \mathrm{(E) \ }108$

Solution

We look at the number of possibilities by considering each dot. If we start with $A$, there are $4$ distinct colors for it. Then, there are $3!$ ways to color the other three dots since they are all distinct. Thus, the number of ways to color the graph is $3! \cdot 4 \cdot 4=96$. However, $A,B,C,D$ are distinct, or in other words, the graphs must be distinct which can occur one way for each pair of starting dots we choose. Thus, the total number is $96-{4\choose 2}=84$.