2007 AIME II Problem 10

Below is the professionally curated solution for Problem 10 of the 2007 AIME II, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2007 AIME II solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:subsetsbasic probabilityinclusion-exclusionbinomial theorem

Difficulty rating: 2840

10.

Let SS be a set with six elements. Let P\mathcal{P} 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.\mathcal{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.)

Solution:

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,\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}}, using k(6k)2k=k(6k)26k=(1+2)6=36.\sum_k \binom{6}{k} 2^k = \sum_k \binom{6}{k} 2^{6-k} = (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.

← Problem 9Full ExamProblem 11

Problem 10 in Other Years