2010 AMC 12A 第 19 题

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

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

19.

一排有 20102010 个盒子,每个盒子里有一颗红弹珠;对 1k20101 \le k \le 2010,第 kk 个盒子还含有 kk 颗白弹珠。Isabella 从第一个盒子开始,依次从每个盒子中随机抽取一颗弹珠。她第一次抽到红弹珠时停止。令 P(n)P(n) 为 Isabella 正好抽取 nn 颗弹珠后停止的概率。使 P(n)<12010P(n) \lt \dfrac{1}{2010} 的最小 nn 是多少?

Each of 20102010 boxes in a line contains a single red marble, and for 1k2010,1 \le k \le 2010, the box in the kkth position also contains kk white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let P(n)P(n) be the probability that Isabella stops after drawing exactly nn marbles. What is the smallest value of nn for which P(n)<12010?P(n) \lt \dfrac{1}{2010}?

4545

6363

6464

201201

10051005

答案:A
知识点:裂项相消基本概率不等式
难度评级:2240
小提示:

n1n-1 次必须抽到白弹珠,第 nn 次抽到红弹珠。

The first n1n-1 draws must be white, then the nnth draw red

大提示:

抽到白弹珠的各个概率相乘后会逐项相消:1223n1n\dfrac12\cdot\dfrac23\cdots\dfrac{n-1}{n}

The white probabilities telescope: 1223n1n\dfrac12\cdot\dfrac23\cdots\dfrac{n-1}{n}

解答:

kk 个盒子中有 k+1k + 1 颗弹珠,所以 Isabella 从中抽到白弹珠的概率为 kk+1\dfrac{k}{k + 1}

抽到红弹珠的概率为 1k+1\dfrac{1}{k + 1}。要在抽到第 nn 颗弹珠后停止,前 n1n - 1 颗必须都是白色。

其概率为 1223n1n1n+1 \dfrac{1}{2} \cdot \dfrac{2}{3} \cdot \ldots \cdot \dfrac{n - 1}{n} \cdot \dfrac{1}{n + 1}\text{。}

所有分子都与相邻分母相消,所以这个表达式化为 1n(n+1)\dfrac{1}{n(n + 1)}

需要寻找最小的 nn,使得 1n(n+1)<12010 \dfrac{1}{n(n + 1)} \lt \dfrac{1}{2010} n(n+1)>2010 n(n + 1) \gt 2010\text{。}

因为 4445=1980<201044\cdot45=1980\lt2010,但 4546=2070>201045\cdot46=2070\gt2010,所以最小的 nn4545

所以正确答案是 A

Since there are k+1k + 1 marbles in the kk th box, there is a kk+1\dfrac{k}{k + 1} chance Isabella draws a white marble from it.

The probability of drawing a red marble is then 1k+1.\dfrac{1}{k + 1}. To stop after drawing the nn th marble, the first n1n - 1 marbles must have been white.

This happens with a probability of 1223n1n1n+1. \dfrac{1}{2} \cdot \dfrac{2}{3} \cdot \ldots \cdot \dfrac{n - 1}{n} \cdot \dfrac{1}{n + 1}.

Note that all the numerators cancel with the adjacent denominator, which means that this expression reduces to 1n(n+1).\dfrac{1}{n(n + 1)}.

We have to find the smallest nn such that 1n(n+1)<12010 \dfrac{1}{n(n + 1)} \lt \dfrac{1}{2010} n(n+1)>2010. n(n + 1) \gt 2010.

Since 4445=1980<201044\cdot45=1980\lt2010 but 4546=2070>2010,45\cdot46=2070\gt2010, the smallest such nn is 45.45.

Thus, A is the correct answer.

第 18 题#18
完整试卷

其他年份的第 19 题

1950 AMC 12 · 1951 AMC 12 · 1952 AMC 12 · 1953 AMC 12 · 1954 AMC 12 · 1955 AMC 12 · 1956 AMC 12 · 1957 AMC 12 · 1958 AMC 12 · 1959 AMC 12 · 1960 AMC 12 · 1961 AMC 12 · 1962 AMC 12 · 1963 AMC 12 · 1964 AMC 12 · 1965 AMC 12 · 1966 AMC 12 · 1967 AMC 12 · 1968 AMC 12 · 1969 AMC 12 · 1970 AMC 12 · 1971 AMC 12 · 1972 AMC 12 · 1973 AMC 12 · 1974 AMC 12 · 1975 AMC 12 · 1976 AMC 12 · 1977 AMC 12 · 1978 AMC 12 · 1979 AMC 12 · 1980 AMC 12 · 1981 AMC 12 · 1982 AMC 12 · 1983 AMC 12 · 1984 AMC 12 · 1985 AMC 12 · 1986 AMC 12 · 1987 AMC 12 · 1988 AMC 12 · 1989 AMC 12 · 1990 AMC 12 · 1991 AMC 12 · 1992 AMC 12 · 1993 AMC 12 · 1994 AMC 12 · 1995 AMC 12 · 1996 AMC 12 · 1997 AMC 12 · 1998 AMC 12 · 1999 AMC 12 · 2000 AMC 12 · 2001 AMC 12 · 2002 AMC 12A · 2002 AMC 12B · 2003 AMC 12A · 2003 AMC 12B · 2004 AMC 12A · 2004 AMC 12B · 2005 AMC 12A · 2005 AMC 12B · 2006 AMC 12A · 2006 AMC 12B · 2007 AMC 12A · 2007 AMC 12B · 2008 AMC 12A · 2008 AMC 12B · 2009 AMC 12A · 2009 AMC 12B · 2010 AMC 12B · 2011 AMC 12A · 2011 AMC 12B · 2012 AMC 12A · 2012 AMC 12B · 2013 AMC 12A · 2013 AMC 12B · 2014 AMC 12A · 2014 AMC 12B · 2015 AMC 12A · 2015 AMC 12B · 2016 AMC 12A · 2016 AMC 12B · 2017 AMC 12A · 2017 AMC 12B · 2018 AMC 12A · 2018 AMC 12B · 2019 AMC 12A · 2019 AMC 12B · 2020 AMC 12A · 2020 AMC 12B · 2021 AMC 12A Spring · 2021 AMC 12B Spring · 2021 AMC 12A Fall · 2021 AMC 12B Fall · 2022 AMC 12A · 2022 AMC 12B · 2023 AMC 12A · 2023 AMC 12B · 2024 AMC 12A · 2024 AMC 12B · 2025 AMC 12A · 2025 AMC 12B