Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Southeastern Mathematical Olympiad

China counting and probability

Problem

Suppose that 12 acrobats labeled are divided into two circles and , with six persons in each. Let each acrobat in stand on the shoulders of two adjacent acrobats of . We call it a tower if the label of each acrobat of is equal to the sum of the labels of the acrobats under his feet. How many different towers can they make?

(Remark. We treat two towers as the same if one can be obtained by rotation or reflection of the other. For example, the following towers are the same, where the labels inside the circle refer to the bottom acrobat, the labels outside the circle refer to the upper acrobat.)

problem


problem


problem


problem


problem


problem


problem
Solution
Denote the sum of labels of and by and , respectively. Then . Thus, we have Obviously, and . Denote , where . Then , and , (if , then , which is a contradiction.)

(1) If , then , , . Thus, or , that is, or .

If , then . Since contains and , there is only one tower that, in , and , and , and , and are adjacent.



If , then . Similarly, we see that, in , and , and , and are adjacent, respectively. There are two arrangements, that is, there are two towers.



(2) If , then , , , where or , that is, or .

If , then . To obtain , and in , , , and in must be adjacent pairwise, it is impossible!



If , then . To obtain , and in , and , and , and must be adjacent in , respectively. There are two arrangements, that is, there are two towers.

(3) If , then , where , . Thus, , that is, and . To obtain , , and in , and , and , and , and must be adjacent, respectively. There is only one tower.



Summing up, there are six different towers all together. ☐
Final answer
6

Techniques

Counting two waysEnumeration with symmetry