2007 AIME II 第 10 题

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

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

10.

SS 为一个有六个元素的集合。令 PPSS 的所有子集组成的集合。令 AABBSS 的两个子集,两者可以相同,并从 PP 中相互独立地随机选取。BBAASAS - A 中至少一个集合的子集,这一事件的概率为 mnr\frac{m}{n^r},其中 mmnnrr 是正整数,nn 是质数,且 mmnn 互质。求 m+n+rm + n + r。(集合 SAS - ASS 中不属于 AA 的所有元素组成的集合。)

Let SS be a set with six elements. Let PP be the set of all subsets of S.S. Subsets AA and BB of S,S, not necessarily distinct, are chosen independently and at random from P.P. The probability that BB is contained in at least one of AA or SAS - A is mnr,\frac{m}{n^r}, where m,m, n,n, and rr are positive integers, nn is prime, and mm and nn are relatively prime. Find m+n+r.m + n + r. (The set SAS - A is the set of all elements of SS which are not in A.A.)

答案:710
知识点:子集基本概率容斥原理二项式定理
难度评级:2840
小提示:

A=k|A| = k 分类,并数集合 BB:它满足 BAB \subseteq ABSAB \subseteq S - A;只有空集同时满足两者。

Condition on A=k|A| = k and count the sets BB with BAB \subseteq A or BSA;B \subseteq S - A; only the empty set satisfies both

大提示:

kk 求和 (6k)(2k+26k1)\binom{6}{k}\left(2^k + 2^{6-k} - 1\right),并使用 k(6k)2k=36\sum_k \binom{6}{k} 2^k = 3^6

Sum over kk the expression (6k)(2k+26k1)\binom{6}{k}\left(2^k + 2^{6-k} - 1\right) using k(6k)2k=36\sum_k \binom{6}{k} 2^k = 3^6

解答:

固定集合 AA,并设 A=k|A| = k。有 2k2^k 个子集满足 BAB \subseteq A,有 26k2^{6-k} 个子集满足 BSAB \subseteq S - A,且只有空集被重复计算,所以有 2k+26k12^k + 2^{6-k} - 1BB 成功。因为共有 (6k)\binom{6}{k} 个集合 AA,其大小为 kk,且各有 262^6 种选择来确定 AABB,所以概率为 1212k=06(6k)(2k+26k1)=23626212 \begin{aligned} &\frac{1}{2^{12}}\sum_{k=0}^{6} \binom{6}{k}\left(2^k + 2^{6-k} - 1\right) \\ &= \frac{2 \cdot 3^6 - 2^6}{2^{12}} \end{aligned}\text{,}这里用到了 k(6k)2k=k(6k)26k\sum_k \binom{6}{k} 2^k = \sum_k \binom{6}{k} 2^{6-k} =(1+2)6=36= (1+2)^6 = 3^6

化简为 3625211=697211\frac{3^6 - 2^5}{2^{11}} = \frac{697}{2^{11}}。因为 697=1741697 = 17 \cdot 41 是奇数,所以 m=697m = 697n=2n = 2r=11r = 11,因而 m+n+r=710m + n + r = 710

Fix AA with A=k.|A| = k. There are 2k2^k subsets BAB \subseteq A and 26k2^{6-k} subsets BSA,B \subseteq S - A, and only the empty set is counted twice, so 2k+26k12^k + 2^{6-k} - 1 choices of BB succeed. Since there are (6k)\binom{6}{k} sets AA of size kk and 262^6 choices for each of AA and B,B, the probability is 1212k=06(6k)(2k+26k1)=23626212, \begin{aligned} &\frac{1}{2^{12}}\sum_{k=0}^{6} \binom{6}{k}\left(2^k + 2^{6-k} - 1\right) \\ &= \frac{2 \cdot 3^6 - 2^6}{2^{12}}, \end{aligned} using k(6k)2k=k(6k)26k\sum_k \binom{6}{k} 2^k = \sum_k \binom{6}{k} 2^{6-k} =(1+2)6=36.= (1+2)^6 = 3^6.

This simplifies to 3625211=697211.\frac{3^6 - 2^5}{2^{11}} = \frac{697}{2^{11}}. Since 697=1741697 = 17 \cdot 41 is odd, we take m=697,m = 697, n=2,n = 2, r=11,r = 11, and m+n+r=710.m + n + r = 710.

第 9 题#9
完整试卷

其他年份的第 10 题