Browse · MathNet
PrintThe 35th Japanese Mathematical Olympiad
Japan counting and probability
Problem
As shown in the figure, seven regular hexagonal cells form a hexagonal pattern. We write one integer from to in each cell without repetition. For any two cells that share an edge, the sum of the integers written in those cells must be at most . How many ways are there to write the integers under these conditions?
Note that two labelings that coincide by rotation or reflection are counted as distinct ways.



Note that two labelings that coincide by rotation or reflection are counted as distinct ways.
Solution
Since the sum of the integers in any two adjacent cells must be at most , the only possible integers that can appear in the neighbors of the cell containing are , , or . Therefore, the cell labeled cannot be the central cell, and there are exactly possible cells in which to place the .
By symmetry, the total number of labelings is times the number of labelings in which the leftmost cell contains . Suppose the leftmost cell contains , and denote this cell by . We classify the other six cells into three groups, , , and , as shown in the left diagram below.
The three cells in group are all adjacent to , so they must be labeled with , , or in some order. The remaining three cells in groups and must be labeled with , , and . Since the two cells labeled and are not adjacent to each other, both of them must lie in group (which consists of two cells), and the cell in group must be labeled .
Conversely, any labeling satisfying these assignments clearly meets the condition that each pair of adjacent cells sums to at most . There are ways to assign to the three cells in , and ways to assign to the two cells in . Hence the total number of labelings is .
Final answer
72
Techniques
Coloring schemes, extremal argumentsCounting two ways