2011 AIME I 第 5 题

先试着解答 2011 AIME I 第 5 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2011 AIME I 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

5.

一个正九边形(99 边形)的顶点要用数字 1199 标记,使得每三个连续顶点上的数之和 都是 33 的倍数。如果一种可行排列可以通过在平面内旋转九边形得到另一种,则这两种排列视为 无法区分。求可区分的可行排列数。

The vertices of a regular nonagon (99-sided polygon) are to be labeled with the digits 11 through 99 in such a way that the sum of the numbers on every three consecutive vertices is a multiple of 3.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.

答案:144
知识点:模运算环形排列乘法原理
难度评级:2420
解答:

两组三个连续顶点有两个标号重叠,所以它们的和相差的是相隔三个位置的两个标号。由于所有三项和都是 33 的倍数,相隔三个位置的标号模 33 同余。因此位置类 {1,4,7}\{1, 4, 7\}{2,5,8}\{2, 5, 8\}{3,6,9}\{3, 6, 9\} 各自只放一种模 33 的剩余类,而数字 1199 正好每个剩余类各有三个数字。

这样每三个连续位置都会包含三个不同剩余类各一个数字,和为 0+1+20(mod3)\equiv 0 + 1 + 2 \equiv 0 \pmod 3,所以剩余类分配到位置类有 3!3! 种方式,且每个位置类内的三个数字可用 3!3! 种方式排列。共有 3!(3!)3=64=12963! \cdot (3!)^3 = 6^4 = 1296 个可行标号。

因为所有数字互不相同,没有非平凡旋转能固定一个标号,所以这 12961296 个标号分成大小为 99 的旋转等价类,得到 12969=144\frac{1296}{9} = 144 种可区分排列。

Two overlapping triples of consecutive vertices share two labels, so their sums differ by labels three positions apart. Since all triple sums are multiples of 3,3, labels three apart are congruent mod 3.3. Thus the position classes {1,4,7},\{1, 4, 7\}, {2,5,8},\{2, 5, 8\}, {3,6,9}\{3, 6, 9\} each carry a single residue class of digits, and the digits 11 through 99 consist of exactly three digits from each residue class mod 3.3.

Every triple of consecutive positions then contains one digit from each residue class, with sum 0+1+20(mod3),\equiv 0 + 1 + 2 \equiv 0 \pmod 3, so all 3!3! assignments of residue classes to position classes are acceptable, and within each position class the three digits can be arranged in 3!3! ways. That gives 3!(3!)3=64=12963! \cdot (3!)^3 = 6^4 = 1296 acceptable labelings.

Because the digits are distinct, no nontrivial rotation fixes a labeling, so the 12961296 labelings split into rotation classes of size 9,9, giving 12969=144\frac{1296}{9} = 144 distinguishable arrangements.

← 第 4 题#4
完整试卷

其他年份的第 5 题