Difference between revisions of "2019 AMC 12B Problems/Problem 13"
(→Solution 1) |
(→Solution 12 (a little bit like Archimedes's Cheese Argument): coincidence, just like solution 11 (if i'm wrong, sorry, and plz correct me)) |
||
(59 intermediate revisions by 26 users not shown) | |||
Line 5: | Line 5: | ||
<math>\textbf{(A) } \frac{1}{4} \qquad\textbf{(B) } \frac{2}{7} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{3}{8} \qquad\textbf{(E) } \frac{3}{7}</math> | <math>\textbf{(A) } \frac{1}{4} \qquad\textbf{(B) } \frac{2}{7} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{3}{8} \qquad\textbf{(E) } \frac{3}{7}</math> | ||
− | ==Solution 1== | + | == Solutions == |
− | + | === Solution 1 === | |
+ | By symmetry, the probability of the red ball landing in a higher-numbered bin is the same as the probability of the green ball landing in a higher-numbered bin. Clearly, the probability of both landing in the same bin is <math>\sum_{k=1}^{\infty}{2^{-k} \cdot 2^{-k}} = \sum_{k=1}^{\infty}2^{-2k} = \frac{1}{3}</math> (by the geometric series sum formula). Therefore, since the other two probabilities have to both the same, they have to be <math>\frac{1-\frac{1}{3}}{2} = \boxed{\textbf{(C) } \frac{1}{3}}</math>. | ||
− | |||
− | |||
− | + | Note: the formula is <math>\frac{a_{1}}{1-r}</math> where <math>a_{1}</math> is the first term and <math>r</math> is the common ratio. | |
+ | Derivation of the geometric series sum formula: | ||
+ | Let <math>S = S=a_{1}+a_{1}r+a_{1}r^{2}+a_{1}r^{3}+...</math> and so on to infinity. | ||
+ | Then <math>rS=a_{1}r+a_{1}r^{2}+a_{1}r^{3}+...</math> and so on to infinity. Notice that the terms in the second expression are the same as all the terms in the first EXCEPT for <math>a_{1}</math>. | ||
+ | Subtract <math>S-rS=a_{1}</math>, factor <math>S\left(1-r\right)=a_{1}</math>, and finally <math>S=\frac{a_{1}}{1-r}</math>. | ||
− | The | + | Note: The formula only works if <math>r<1</math>; otherwise, the series will diverge to infinity or negative infinity. |
+ | ~JH. L | ||
− | ==Solution 2 | + | === Solution 2 === |
− | Suppose the green ball goes in bin <math>i</math>, for some <math>i \ge 1</math>. The probability of this occurring is <math>\frac{1}{2^i}</math>. Given this occurs, the probability that the red ball goes in a higher-numbered bin is <math>\frac{1}{2^{i+1}} + \frac{1}{2^{i+2}} + \ldots = \frac{1}{2^i}</math>. Thus the probability that the green ball goes in bin <math>i</math>, and the red ball goes in a bin greater than <math>i</math>, is <math>\left(\frac{1}{2^i}\right)^2 = \frac{1}{4^i}</math>. Summing from <math>i=1</math> to infinity, we get | + | Suppose the green ball goes in bin <math>i</math>, for some <math>i \ge 1</math>. The probability of this occurring is <math>\frac{1}{2^i}</math>. Given that this occurs, the probability that the red ball goes in a higher-numbered bin is <math>\frac{1}{2^{i+1}} + \frac{1}{2^{i+2}} + \ldots = \frac{1}{2^i}</math> (by the geometric series sum formula). Thus the probability that the green ball goes in bin <math>i</math>, and the red ball goes in a bin greater than <math>i</math>, is <math>\left(\frac{1}{2^i}\right)^2 = \frac{1}{4^i}</math>. Summing from <math>i=1</math> to infinity, we get |
<cmath>\sum_{i=1}^{\infty} \frac{1}{4^i} = \boxed{\textbf{(C) } \frac{1}{3}}</cmath> | <cmath>\sum_{i=1}^{\infty} \frac{1}{4^i} = \boxed{\textbf{(C) } \frac{1}{3}}</cmath> | ||
+ | where we again used the geometric series sum formula. (Alternatively, if this sum equals <math>n</math>, then by writing out the terms and multiplying both sides by <math>4</math>, we see <math>4n = n+1</math>, which gives <math>n = \frac{1}{3}</math>.) | ||
− | + | === Solution 3 === | |
+ | For red ball in bin <math>k</math>, <math>\Pr(\text{Green Below Red})=\sum\limits_{i=1}^{k-1}2^{-i}</math> (GBR) and <math>\Pr(\text{Red in Bin k}=2^{-k}</math> (RB). | ||
+ | <cmath>\Pr(\text{GBR}|\text{RB})=\sum\limits_{k=1}^{\infty}2^{-k}\sum\limits_{i=1}^{k-1}2^{-i}=\sum\limits_{k=1}^{\infty}2^{-k}\cdot\frac{1}{2}(\frac{1-(1/2)^{k-1}}{1-1/2})</cmath> | ||
+ | <cmath>\sum\limits_{k=1}^{\infty}\frac{1}{2^{-k}}-2\sum\limits_{k=1}^\infty\frac{1}{(2^2)^{-k}}\implies 1-2/3=\boxed{(\textbf{C}) \frac{1}{3}}</cmath> | ||
− | + | === Solution 4 === | |
− | ==Solution | + | The probability that the two balls will go into adjacent bins is <math>\frac{1}{2\times4} + \frac{1}{4\times8} + \frac{1}{8 \times 16} + ... = \frac{1}{8} + \frac{1}{32} + \frac{1}{128} + \cdots = \frac{1}{6}</math> by the geometric series sum formula. Similarly, the probability that the two balls will go into bins that have a distance of <math>2</math> from each other is <math>\frac{1}{2 \times 8} + \frac{1}{4 \times 16} + \frac{1}{8 \times 32} + \cdots = \frac{1}{16} + \frac{1}{64} + \frac{1}{256} + \cdots = \frac{1}{12}</math> (again recognizing a geometric series). We can see that each time we add a bin between the two balls, the probability halves. Thus, our answer is <math>\frac{1}{6} + \frac{1}{12} + \frac{1}{24} + \cdots</math>, which, by the geometric series sum formula, is <math>\boxed{\textbf{(C) } \frac{1}{3}}</math>. |
− | The probability that the two balls will go into adjacent bins is <math>\frac{1}{2\times4} + \frac{1}{4\times8} + \frac{1}{8 \times 16} + ... = \frac{1}{8} + \frac{1}{32} + \frac{1}{128} = \frac{1}{6}</math>. | + | -fidgetboss_4000 |
− | ==Solution | + | === Solution 5 (quick, conceptual) === |
Define a win as a ball appearing in higher numbered box. | Define a win as a ball appearing in higher numbered box. | ||
Start from the first box. | Start from the first box. | ||
− | There are 4 possible results in the box: Red, Green, Red and Green, none, with probability of <math>\frac{1}{4}</math> for each. | + | There are <math>4</math> possible results in the box: Red, Green, Red and Green, or none, with an equal probability of <math>\frac{1}{4}</math> for each. If none of the balls is in the first box, the game restarts at the second box with the same kind of probability distribution, so if <math>p</math> is the probability that Red wins, we can write <math>p = \frac{1}{4} + \frac{1}{4}p</math>: there is a <math>\frac{1}{4}</math> probability that "Red" wins immediately, a <math>0</math> probability in the cases "Green" or "Red and Green", and in the "None" case (which occurs with <math>\frac{1}{4}</math> probability), we then start again, giving the same probability <math>p</math>. Hence, solving the equation, we get <math>p = \boxed{\textbf{(C) } \frac{1}{3}}</math>. |
− | + | === Solution 6 === | |
+ | Write out the infinite geometric series as <math>\frac{1}{2}</math>, <math>\frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \cdots</math>. To find the probablilty that red goes in a higher-numbered bin than green, we can simply remove all odd-index terms (i.e term <math>1</math>, term <math>3</math>, etc.), and then sum the remaining terms - this is in fact precisely equivalent to the method of Solution 2. Writing this out as another infinite geometric sequence, we are left with <math>\frac{1}{4}, \frac{1}{16}, \frac{1}{64}, \cdots</math>. Summing, we get <cmath>\sum_{i=1}^{\infty} \frac{1}{4^i} = \boxed{\textbf{(C) } \frac{1}{3}}</cmath> | ||
− | + | === Solution 7 === | |
+ | Fixing the green ball to fall into bin <math>1</math> gives a probability of <math>\frac{1}{2}\left(\frac{1}{2^2}+\frac{1}{2^3} +...\right)</math> for the red ball to fall into a higher bin. Fixing the green ball to fall into bin <math>2</math> gives a probability of <math>\frac{1}{2^2}\left(\frac{1}{2^3}+\frac{1}{2^4} +...\right)</math>. Factoring out the denominator of the first fraction in each probability gives <math>\frac{1}{2^3}\left(1+\frac{1}{2}+\frac{1}{2^2}+...\right)+\frac{1}{2^5}\left(1+\frac{1}{2}+\frac{1}{2^2}+...\right)+...</math> so factoring out <math>\left(1+\frac{1}{2}+\frac{1}{2^2}+\frac{1}{2^3}+...\right)</math> results in the probability simplifying to <math>\left(\frac{1}{2^3}+\frac{1}{2^5}+\frac{1}{2^7}+...\right)\left(1+\frac{1}{2}+\frac{1}{2^2}+\frac{1}{2^3}+...\right)</math> and using the formula <math>\frac{a}{1-r}</math> to find both series, we obtain <math>\left(\frac{\frac{1}{2^3}}{1-\frac{1}{4}}\right)\left(\frac{1}{1-\frac{1}{2}}\right)</math> which simplifies to <math>\boxed{\textbf{(C) } \frac{1}{3}}</math> -- OGBooger | ||
− | + | === Solution 8 === | |
+ | We can think of this problem as "what is the probability that the green ball's bin is less than the red ball's bin". We do not consider the case where the red ball goes into bin <math>1</math> because the green ball has no where to go then. The chance that the green one is below the red one if the red one goes to bin <math>2</math> is <math>\frac{1}{4}</math> chance that the red ball even goes in bin <math>2</math> and <math>\frac{1}{2}</math> chance that the green ball goes into any bin less than <math>2</math>. Similarly, if the red goes into bin <math>3</math>, there is a <math>\frac{1}{8} \cdot \left(\frac{1}{4} + \frac{1}{2}\right)</math> chance, or <math>\frac{3}{32}</math>, continuing like this, we get this sequence: | ||
− | ==See Also== | + | <math>\frac{1}{8}, \frac{3}{32}, \frac{7}{128}, ...</math> |
+ | |||
+ | Let <math>S</math> equal the sum of our series: | ||
+ | |||
+ | <math>S = \frac{1}{8} + \frac{3}{32} + \frac{7}{128} + ...</math>. That means we can write another equation: | ||
+ | <math>\frac{S}{4} = \frac{1}{32} + \frac{3}{128} + ...</math> | ||
+ | |||
+ | Subtracting <math>\frac{S}{4}</math> from <math>S</math>, yields: | ||
+ | |||
+ | <math>S - \frac{S}{4} = \frac{1}{8} + \frac{2}{32} + \frac{4}{128} + ...</math> | ||
+ | |||
+ | We see that the above series is a infinite geometric sequence with common ratio <math>\frac{1}{2}</math>. Therefore, the sum of that infinite series is <math>\frac{\frac{1}{8}}{\frac{1}{2}}</math>, which equals <math>\frac{1}{4}</math>. Our equation is now <math>S - \frac{S}{4} = \frac{1}{4}</math>. Solving for <math>S</math> shows that <math>S = \frac{1}{3}</math>. | ||
+ | |||
+ | Our answer is <math>\boxed{\textbf{(C) }\frac{1}{3}}</math> | ||
+ | |||
+ | ~ericshi1685 | ||
+ | |||
+ | === Solution 9 (quick, symmetry) === | ||
+ | |||
+ | Denote <math>G,R</math> the bin numbers of the green and red balls, respectively. The common probability distribution of <math>G,B</math> can be constructed by keep splitting the remaining unassigned probability into two halves: one goes to the smallest number that has not been assigned, and the other goes to the rest. In other words, <math>\Pr(G=k) = \Pr (G>k), \forall k \in \mathbb{N}</math>. Then, | ||
+ | |||
+ | <cmath> | ||
+ | \Pr(G>R)=\sum_{k=1}^\infty \Pr(G>k) \Pr(R=k) = \sum_{k=1}^\infty \Pr(G=k) \Pr(R=k) = \Pr (G=R) | ||
+ | </cmath> | ||
+ | |||
+ | Similarly <math>\Pr(G<R)=\Pr(G=R)</math>. Therefore all three probabilities equal <math>\boxed{\textbf{(C) }\frac{1}{3}}</math>. | ||
+ | |||
+ | ~asops | ||
+ | |||
+ | === Solution 10 === | ||
+ | |||
+ | The probability of the red ball falling ahead of the green ball is the same as the probability of the green ball falling ahead of the red ball. Therefore, if we calculate the probability of the red ball and the green ball falling inside the same box, we get the answer by subtracting that probability from 1. <math>P(same) = \left(\frac{1}{2}\right)^2 + \left(\frac{1}{4}\right)^2 + \left(\frac{1}{8}\right)^2 + \cdots = \frac{1}{4} + \frac{1}{16} + \frac{1}{64} = \frac{1}{3}</math>. Therefore, our answer is <math>\frac{1-\frac{1}{3}}{2} = \boxed{\frac{1}{3}}</math> | ||
+ | |||
+ | -NL008 | ||
+ | |||
+ | == Video Solutions == | ||
+ | === Video Solution by OnTheSpotSTEM === | ||
+ | https://youtu.be/VP7ltu-XEq8 | ||
+ | |||
+ | ===Video Solution by TheBeautyofMath=== | ||
+ | https://youtu.be/_0YaCyxiMBo?t=353 | ||
+ | |||
+ | ~IceMatrix | ||
+ | |||
+ | ===Video Solution 3, by OmegaLearn === | ||
+ | https://youtu.be/IRyWOZQMTV8?t=2484 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | |||
+ | ===Related Video=== | ||
+ | https://www.youtube.com/watch?v=RBf1s4TassI | ||
+ | |||
+ | == See Also == | ||
{{AMC10 box|year=2019|ab=B|num-b=16|num-a=18}} | {{AMC10 box|year=2019|ab=B|num-b=16|num-a=18}} | ||
{{AMC12 box|year=2019|ab=B|num-b=12|num-a=14}} | {{AMC12 box|year=2019|ab=B|num-b=12|num-a=14}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 21:57, 14 July 2024
- The following problem is from both the 2019 AMC 10B #17 and 2019 AMC 12B #13, so both problems redirect to this page.
Contents
Problem
A red ball and a green ball are randomly and independently tossed into bins numbered with the positive integers so that for each ball, the probability that it is tossed into bin is
for
What is the probability that the red ball is tossed into a higher-numbered bin than the green ball?
Solutions
Solution 1
By symmetry, the probability of the red ball landing in a higher-numbered bin is the same as the probability of the green ball landing in a higher-numbered bin. Clearly, the probability of both landing in the same bin is (by the geometric series sum formula). Therefore, since the other two probabilities have to both the same, they have to be
.
Note: the formula is where
is the first term and
is the common ratio.
Derivation of the geometric series sum formula:
Let
and so on to infinity.
Then
and so on to infinity. Notice that the terms in the second expression are the same as all the terms in the first EXCEPT for
.
Subtract
, factor
, and finally
.
Note: The formula only works if ; otherwise, the series will diverge to infinity or negative infinity.
~JH. L
Solution 2
Suppose the green ball goes in bin , for some
. The probability of this occurring is
. Given that this occurs, the probability that the red ball goes in a higher-numbered bin is
(by the geometric series sum formula). Thus the probability that the green ball goes in bin
, and the red ball goes in a bin greater than
, is
. Summing from
to infinity, we get
where we again used the geometric series sum formula. (Alternatively, if this sum equals
, then by writing out the terms and multiplying both sides by
, we see
, which gives
.)
Solution 3
For red ball in bin ,
(GBR) and
(RB).
Solution 4
The probability that the two balls will go into adjacent bins is by the geometric series sum formula. Similarly, the probability that the two balls will go into bins that have a distance of
from each other is
(again recognizing a geometric series). We can see that each time we add a bin between the two balls, the probability halves. Thus, our answer is
, which, by the geometric series sum formula, is
.
-fidgetboss_4000
Solution 5 (quick, conceptual)
Define a win as a ball appearing in higher numbered box.
Start from the first box.
There are possible results in the box: Red, Green, Red and Green, or none, with an equal probability of
for each. If none of the balls is in the first box, the game restarts at the second box with the same kind of probability distribution, so if
is the probability that Red wins, we can write
: there is a
probability that "Red" wins immediately, a
probability in the cases "Green" or "Red and Green", and in the "None" case (which occurs with
probability), we then start again, giving the same probability
. Hence, solving the equation, we get
.
Solution 6
Write out the infinite geometric series as ,
. To find the probablilty that red goes in a higher-numbered bin than green, we can simply remove all odd-index terms (i.e term
, term
, etc.), and then sum the remaining terms - this is in fact precisely equivalent to the method of Solution 2. Writing this out as another infinite geometric sequence, we are left with
. Summing, we get
Solution 7
Fixing the green ball to fall into bin gives a probability of
for the red ball to fall into a higher bin. Fixing the green ball to fall into bin
gives a probability of
. Factoring out the denominator of the first fraction in each probability gives
so factoring out
results in the probability simplifying to
and using the formula
to find both series, we obtain
which simplifies to
-- OGBooger
Solution 8
We can think of this problem as "what is the probability that the green ball's bin is less than the red ball's bin". We do not consider the case where the red ball goes into bin because the green ball has no where to go then. The chance that the green one is below the red one if the red one goes to bin
is
chance that the red ball even goes in bin
and
chance that the green ball goes into any bin less than
. Similarly, if the red goes into bin
, there is a
chance, or
, continuing like this, we get this sequence:
Let equal the sum of our series:
. That means we can write another equation:
Subtracting from
, yields:
We see that the above series is a infinite geometric sequence with common ratio . Therefore, the sum of that infinite series is
, which equals
. Our equation is now
. Solving for
shows that
.
Our answer is
~ericshi1685
Solution 9 (quick, symmetry)
Denote the bin numbers of the green and red balls, respectively. The common probability distribution of
can be constructed by keep splitting the remaining unassigned probability into two halves: one goes to the smallest number that has not been assigned, and the other goes to the rest. In other words,
. Then,
Similarly . Therefore all three probabilities equal
.
~asops
Solution 10
The probability of the red ball falling ahead of the green ball is the same as the probability of the green ball falling ahead of the red ball. Therefore, if we calculate the probability of the red ball and the green ball falling inside the same box, we get the answer by subtracting that probability from 1. . Therefore, our answer is
-NL008
Video Solutions
Video Solution by OnTheSpotSTEM
Video Solution by TheBeautyofMath
https://youtu.be/_0YaCyxiMBo?t=353
~IceMatrix
Video Solution 3, by OmegaLearn
https://youtu.be/IRyWOZQMTV8?t=2484
~ pi_is_3.14
Related Video
https://www.youtube.com/watch?v=RBf1s4TassI
See Also
2019 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
2019 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 12 |
Followed by Problem 14 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.