2005 AMC 12B 第 25 题

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

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

25.

六只蚂蚁同时站在一个正八面体的六个顶点上,每个顶点一只。它们同时且独立地从所在顶点移动到四个相邻顶点之一,每个选择概率相同。没有两只蚂蚁到达同一顶点的概率是多少?
Six ants simultaneously stand on the six vertices of a regular octahedron, with each ant at a different vertex. Simultaneously and independently, each ant moves from its vertex to one of the four adjacent vertices, each with equal probability. What is the probability that no two ants arrive at the same vertex?
5256\dfrac{5}{256}
211024\dfrac{21}{1024}
11512\dfrac{11}{512}
231024\dfrac{23}{1024}
3128\dfrac{3}{128}
答案:A
知识点:基本概率有限制的排列分类讨论
小提示:
共有 464^6 种移动组合;每个顶点只与它的对顶点不相邻。
There are 464^6 move combinations; each vertex is non-adjacent only to its opposite
大提示:
有效的最终分配是一个排列,且没有顶点被送到自身或对顶点;按对顶点的像是相对还是相邻分类。
A valid final assignment is a permutation with no vertex sent to itself or its opposite; split by whether opposite vertices’ images are opposite or adjacent
解答:
共有 464^6 种等可能移动。把顶点标为 A,B,C,A′,B′,C′A, B, C, A', B', C',其中带撇号的是对应对顶点。有效结果是一个排列 ff,且 f(A)∉{A,A′}f(A) \notin \{A, A'\},其他顶点同理。
有序对 (f(A),f(A′))(f(A), f(A')) 有 4⋅3=124 \cdot 3 = 12 个选择。其中 f(A)f(A)、f(A′)f(A') 互为对顶点的有 44 种,相邻的有 88 种。
若 f(A),f(A′)f(A), f(A') 互为对顶点,例如 B,B′B, B',则 {f(C),f(C′)}={A,A′}\{f(C), f(C')\} = \{A, A'\},且 {f(B),f(B′)}={C,C′}\{f(B), f(B')\} = \{C, C'\},给出 4⋅2⋅2=164 \cdot 2 \cdot 2 = 16 种。
若 f(A),f(A′)f(A), f(A') 相邻,例如 B,CB, C,则 f(B),f(B′)f(B), f(B') 中必须有一个是 C′C',有 44 个有序选择 (f(B),f(B′))(f(B), f(B')),每个给 (f(C),f(C′))(f(C), f(C')) 留下 22 种,共 8⋅4⋅2=648 \cdot 4 \cdot 2 = 64 种。
概率为 16+6446=804096=5256。 \dfrac{16 + 64}{4^6} = \dfrac{80}{4096} = \dfrac{5}{256}\text{。}
所以正确答案是 A。
There are 464^6 equally likely combinations of moves. Label the vertices A,B,C,A′,B′,C′,A, B, C, A', B', C', where primed vertices are opposite the corresponding unprimed ones. An ant cannot move to its own vertex or the opposite one, so a valid outcome is a permutation ff with f(A)∉{A,A′},f(A) \notin \{A, A'\}, and similarly for each pair.
There are 4⋅3=124 \cdot 3 = 12 ordered choices for (f(A),f(A′)).(f(A), f(A')). Of these, f(A)f(A) and f(A′)f(A') are opposite in 44 cases and adjacent in 8.8.
If f(A),f(A′)f(A), f(A') are opposite, say B,B′,B, B', then {f(C),f(C′)}={A,A′}\{f(C), f(C')\} = \{A, A'\} and {f(B),f(B′)}={C,C′},\{f(B), f(B')\} = \{C, C'\}, giving 4⋅2⋅2=164 \cdot 2 \cdot 2 = 16 valid combinations.
If f(A),f(A′)f(A), f(A') are adjacent, say B,C,B, C, then one of f(B),f(B′)f(B), f(B') must be C′C' and there are 44 ordered choices for (f(B),f(B′)),(f(B), f(B')), each leaving 22 for (f(C),f(C′)):(f(C), f(C')): that is 8⋅4⋅2=648 \cdot 4 \cdot 2 = 64 valid combinations.
Hence the probability is 16+6446=804096=5256. \dfrac{16 + 64}{4^6} = \dfrac{80}{4096} = \dfrac{5}{256}.
Thus, the correct answer is A.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.