返回题库

AIME 2026 II · 第 5 题

AIME 2026 II — Problem 5

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem 5

An urn contains nn marbles. Each marble is either red or blue, and there are at least 77 marbles of each color. When 77 marbles are drawn randomly from the urn without replacement, the probability that exactly 44 of them are red equals the probability that exactly 55 of them are red. Find the sum of the five least values of nn for which this is possible.

解析

Solution 1

Let rr be the number of red marbles and bb be the number of blue marbles in the urn. The total number of marbles is n=r+bn = r + b, with the constraints

r7,b7.r \geq 7,\quad b \geq 7. Since the total number of ways to choose 7 marbles is (n7)\dbinom{n}{7} for both events, their favorable outcomes satisfy:

(r4)(b3)=(r5)(b2).\dbinom{r}{4}\dbinom{b}{3}=\dbinom{r}{5}\dbinom{b}{2}. We simplify the equation using the combinatorial definition (km)=k!m!(km)!\dbinom{k}{m}=\dfrac{k!}{m!(k-m)!}:

r!4!(r4)!b!3!(b3)!=r!5!(r5)!b!2!(b2)!.\frac{r!}{4!(r-4)!}\cdot\frac{b!}{3!(b-3)!}=\frac{r!}{5!(r-5)!}\cdot\frac{b!}{2!(b-2)!}. We cancel common terms and reduce factorials:

b23=r45.\frac{b-2}{3}=\frac{r-4}{5}. We cross-multiply to eliminate fractions:

5(b2)=3(r4).5(b-2)=3(r-4). Expanding and rearranging terms gives:

5b10=3r12    3r5b=2.5b-10=3r-12 \implies 3r-5b=2. Now we solve the Diophantine equation 3r5b=23r-5b=2 for integers r,b7r,b\geq7.

From the equation 3r5b=23r - 5b = 2, by guess and check we find the smallest integer solution is (r,b)=(4,2)(r,b) = (4,2). We then get all solutions by increasing rr by 55 and bb by 33 each time: \begin{align*} r &= 4 + 5k, \\ b &= 2 + 3k. \end{align*}

With r7r\ge7, b7b\ge7, the five smallest values of nn are \begin{align*} k &= 2: & n &= 22, \\ k &= 3: & n &= 30, \\ k &= 4: & n &= 38, \\ k &= 5: & n &= 46, \\ k &= 6: & n &= 54. \end{align*}

Finally we sum the five values:

22+30+38+46+54=190.22+30+38+46+54=\boxed{190}. ~Steven Zheng

Solution 2

Assuming there are aa red marbles, we write the original expression for the probability as

Ca4Cna3Cn7=Ca5Cna2Cn7.\dfrac{C_a^4\cdot C_{n-a}^3}{C_n^7}=\dfrac{C_a^5\cdot C_{n-a}^2}{C_n^7}. Canceling the denominators and rewriting in factorial form gives

a!4!(a4)!(na)!3!(na3)!=a!5!(a5)!(na)!2!(na2)!.\dfrac{a!}{4!\cdot(a-4)!}\cdot\dfrac{(n-a)!}{3!\cdot(n-a-3)!}=\dfrac{a!}{5!\cdot(a-5)!}\cdot\dfrac{(n-a)!}{2!\cdot(n-a-2)!}. Simplifying yields 3(a4)=5(na2)3(a-4)=5(n-a-2), i.e., 8a2=5n8a-2=5n, with a,na7a,n-a\ge7. The smallest solution is easily found to be a,n=14,22a,n=14,22, and the smallest 55 values of nn are 22,30,38,46,5422,30,38,46,54, whose sum is the final answer 190\fbox{190}. ~Confringo

Solution 3 (easy to understand but a little bashy)

Let there be rr red marbles and bb blue marbles. Consider the probability of getting 44 red marbles and 33 blue marbles. This is

rr+br1r+b1r2r+b2r3r+b3br+b4b1r+b5b2r+b6\frac{r}{r+b} \cdot \frac{r-1}{r+b-1} \cdot \frac{r-2}{r+b-2} \cdot \frac{r-3}{r+b-3} \cdot \frac{b}{r+b-4} \cdot \frac{b-1}{r+b-5} \cdot \frac{b-2}{r+b-6} but we multiply by (74)\binom{7}{4} for the possible arrangements. Now, we do something clever when calculating the probability of getting 55 red marbles and 22 blue marbles. This probability is

rr+br1r+b1r2r+b2r3r+b3br+b4b1r+b5r4r+b6\frac{r}{r+b} \cdot \frac{r-1}{r+b-1} \cdot \frac{r-2}{r+b-2} \cdot \frac{r-3}{r+b-3} \cdot \frac{b}{r+b-4} \cdot \frac{b-1}{r+b-5} \cdot \frac{r-4}{r+b-6} The clever thing was picking the marbles in the other red-red-red-red-blue-blue-red so it is easier to see that things cancel. We of course multiply by (75)\binom{7}{5}. Thus, upon cancellation, we obtain

35b2r+b6=21r4r+b65(b2)=3(r4)3r5b=235 \cdot \frac{b-2}{r+b-6} = 21 \cdot \frac{r-4}{r+b-6} \rightarrow 5(b-2)=3(r-4) \rightarrow 3r-5b=2 Now, we can use moduli to determine that 3r5b5bb(mod3)3r-5b \equiv -5b \equiv b \pmod{3}, so b2(mod3)b \equiv 2 \pmod{3}. This means that the smallest solution is (r,b)=(4,2)(r, b)=(4, 2). Now, if (r,b)(r, b) is a solution, then (r+5,b+3)(r+5, b+3) is also a solution because 3(r+5)5(b+3)=3r5b3(r+5)-5(b+3)=3r-5b. Thus, we can generate solutions, where the five smallest ones with b7b \ge 7 and r7r \ge 7 are (14,8)(14, 8), (19,11)(19, 11) (24,14)(24, 14), (29,17)(29, 17). and (34,20)(34, 20). This means the sum of the five smallest values of nn are 22+30+38+46+54=19022+30+38+46+54=\fbox{190}