返回题库

AIME 2008 I · 第 9 题

AIME 2008 I — Problem 9

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Ten identical crates each of dimensions 3ft×4ft×6ft3\mathrm{ft}\times 4\mathrm{ft}\times 6\mathrm{ft}. The first crate is placed flat on the floor. Each of the remaining nine crates is placed, in turn, flat on top of the previous crate, and the orientation of each crate is chosen at random. Let mn\frac {m}{n} be the probability that the stack of crates is exactly 41ft41\mathrm{ft} tall, where mm and nn are relatively prime positive integers. Find mm.

解析

Solution

Only the heights matter, and each crate is either 3, 4, or 6 feet tall with equal probability. We have the following:

3a+4b+6c=41a+b+c=10\begin{aligned}3a + 4b + 6c &= 41\\ a + b + c &= 10\end{aligned} Subtracting 3 times the second from the first gives b+3c=11b + 3c = 11, or (b,c)=(2,3),(5,2),(8,1),(11,0)(b,c) = (2,3),(5,2),(8,1),(11,0). The last doesn't work, obviously. This gives the three solutions (a,b,c)=(5,2,3),(3,5,2),(1,8,1)(a,b,c) = (5,2,3),(3,5,2),(1,8,1). In terms of choosing which goes where, the first two solutions are analogous.

For (5,2,3),(3,5,2)(5,2,3),(3,5,2), we see that there are 210!5!2!3!=109872\cdot\dfrac{10!}{5!2!3!} = 10\cdot9\cdot8\cdot7 ways to stack the crates. For (1,8,1)(1,8,1), there are 10!8!1!1!=90\dfrac{10!}{8!1!1!} = 90. Also, there are 3103^{10} total ways to stack the crates to any height.

Thus, our probability is 10987+90310=1087+1038=57038=19037\dfrac{10\cdot9\cdot8\cdot7 + 90}{3^{10}} = \dfrac{10\cdot8\cdot7 + 10}{3^{8}} = \dfrac{570}{3^8} = \dfrac{190}{3^{7}}. Our answer is the numerator, 190\boxed{190}.

1 Min Solution

It would be helpful for this solution to be reformatted. To start with, let us observe the three numbers. Note that 33 and 66 are both divisible by 33, so the number of 44-crates must be congruent to 41mod341\bmod{3}, which is also congruent to 2mod32\bmod{3}. Our solutions for the number of 44-crates will repeat mod 33, so if xx is a solution, so is x+3x+3. By inspection, we have that 22 is solution, and so are 55 and 88. Each solution splits into its own case.We must solve the equation 414z=6x+3y41-4z=6x+3y, simultaneously with x+y=10zx+y=10-z. Note that we already know the possible values of zz. Solving these (it's AIME 99, you should be able to do this and if anyone feels like they want to write a rundown of this please go ahead), we get the solution sets {8,1,1},{5,2,3},\{8,1,1\},\{5,2,3\}, and {2,3,5}\{2,3,5\}. We can count the number of possible arrangements for each solution by taking (10z)\dbinom{10}{z} and then multiplying by (10zx)\dbinom{10-z}{x} (the solution sets, for the sake of consistency, are in the form z,x,yz,x,y). Summing the results for all the solutions gives us 51305130. Finally, to calculate the probability we must determine our denominator. Since we have 33 ways to arrange each block, our denominator is 3103^{10}. 5130310=19037\frac{5130}{3^{10}}=\frac{190}{3^7}. The answer is m=190m=\boxed{190}.

Solution 2 (a more direct approach)

Let's make two observations. We are trying to find the number of ways we can add 3s,4s3\text{s}, 4\text{s}, and 6s6\text{s} to get 4141, and the total number of (non-distinct) sums possible is 3103^{10}. Then we just use casework to easily and directly solve for the number of ways to get 4141. To begin, the minimum sum is produced with 1010 threes, so WLOG we can solve for the number of ways to get 1111 with 0s,1s0\text{s}, 1\text{s}, and 3s3\text{s}.

Case I: 00 zeroes, 00 threes, 1111 ones Impossible, because there are only ten available spots.

Case II: 11 zero, 11 three, 88 ones This is just 10!8!\frac{10!}{8!}, so there are 9090 possibilities.

Case III: 33 zeroes, 22 threes, 55 ones This is just 10!3!2!5!\frac{10!}{3!2!5!}. This gives 25202520 possibilities.

Case IV: 5 zeroes, 3 threes, and 2 ones. This is the same as case 33, so also 25202520 possibilities.

90+2520+2520=513090+2520+2520=5130

51305130 has three powers of 33, so 51305130 divided by 2727 is 190\boxed{190}.

-jackshi2006

Solution 3 (Generating Functions)

Note we are placing 10 crates where each "height" is 3, 4, 6 and we want all the heights to sum to 41. We can model this as the generating function

(x3+x4+x6)10\left(x^3+x^4+x^6\right)^{10} where we want the coefficient of x41.x^{41}. First off, factor this to get

x30(1+x+x3)10{x^{30} \left(1 + x + x^3\right)^{10}} and then see that we want the coefficient of x11x^{11} in (1+x+x3)10.\left(1+x+x^3\right)^{10}. From multinomial theorem, this expansion is

a+b+c=10(10a,b,c)1axbx3c\sum_{a+b+c=10}\binom{10}{a,b,c}1^ax^bx^{3c} If we want the coefficient of x11x^{11} then we need b+3c=11.b + 3c = 11. with b+c10b + c \le 10(from the multinomial expansion). This has the solutions (b,c)={8,1},{5,2},{2,3}.(b, c) = \{8, 1\}, \{5, 2\}, \{2, 3\}. Note that the denominator of the answer is just 3103^{10} since there are 3 ways to orientate every crate and there are 10 creates. Thus, our answer is

(108,1,1)+(105,2,3)+(102,3,5)310=19037190\frac{\binom{10}{8,1,1} + \binom{10}{5,2,3} + \binom{10}{2,3,5}}{3^{10}} = \frac{190}{3^7} \rightarrow \boxed{190}

Video Solution (Very fast)

https://www.youtube.com/watch?v=qeSY_ISSX6M&t=33s

~fidgetboss_4000