2011 AIME I Problems/Problem 5
The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits 1 through 9 in such a way that the sum of the numbers on every three consecutive vertices is a multiple of 3. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.
First, we determine which possible combinations of digits through will yield sums that are multiples of . It is simplest to do this by looking at each of the digits .
We see that the numbers and are congruent to , that the numbers and are congruent to , and that the numbers and are congruent to . In order for a sum of three of these numbers to be a multiple of three, the mod sum must be congruent to . Quick inspection reveals that the only possible combinations are and . However, every set of three consecutive vertices must sum to a multiple of three, so using any of , or would cause an adjacent sum to include exactly digits with the same value, and this is an unacceptable arrangement. Thus the only possible groupings are composed of three digits congruent to three different values.
We see also that there are two possible arrangements for these trios on the nonagon: a digit congruent to can be located counterclockwise of a digit congruent to and clockwise of a digit congruent to , or the reverse can be true.
We set the first digit as avoid overcounting rotations, so we have one option as a choice for the first digit. The other two numbers can be arranged in ways. The three and three can both be arranged in ways. Therefore, the desired result is .
Notice that there are three triplets of congruent integers mod : and There are ways to order each of the triplets individually and ways to order the triplets as a group. Rotations are indistinguishable, so there are total arrangements.
|2011 AIME I (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|