2012 AIME II Problems/Problem 14
Problem 14
In a group of nine people each person shakes hands with exactly two of the other people from the group. Let be the number of ways this handshaking can occur. Consider two handshaking arrangements different if and only if at least two people who shake hands under one arrangement do not shake hands under the other arrangement. Find the remainder when is divided by .
Solution 1
Given that each person shakes hands with two people, we can view all of these through graph theory as 'rings'. This will split it into four cases: Three rings of three, one ring of three and one ring of six, one ring of four and one ring of five, and one ring of nine. (All other cases that sum to nine won't work, since they have at least one 'ring' of two or fewer points, which doesn't satisfy the handshaking conditions of the problem.)
Case 1: To create our groups of three, there are . In general, the number of ways we can arrange people within the rings to count properly is , since there are ways to arrange items in the circle, and then we don't want to want to consider reflections as separate entities. Thus, each of the three cases has arrangements. Therefore, for this case, there are
Case 2: For three and six, there are sets for the rings. For organization within the ring, as before, there is only one way to arrange the ring of three. For six, there is . This means there are arrangements.
Case 3: For four and five, there are sets for the rings. Within the five, there are , and within the four there are arrangements. This means the total is .
Case 4: For the nine case, there is arrangement for the ring. Within it, there are arrangements.
Summing the cases, we have .
Solution 2 (Video Solution)
Very Neat solution: https://www.youtube.com/watch?v=lG8N9RuI-8o
Similar Problems
2006 HMMT feb. combo #9.
See Also
2012 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.