Difference between revisions of "2016 AMC 8 Problems/Problem 21"
Thatcarguy3 (talk | contribs) m (Undo revision 212027 by Checkmate2021 (talk)) (Tag: Undo) |
Thatcarguy3 (talk | contribs) m (→Solution 5) |
||
Line 29: | Line 29: | ||
We can use basic probability to find the answer to this question. The probability of the first chip being red is <math>\frac{3}{5}</math> because there are <math>3</math> red chips and <math>5</math> chips in total. The probability of the second chip being red is <math>\frac{2}{4}</math> because there are now <math>2</math> red chips and <math>4</math> total chips. The probability of the third chip being red is <math>\frac{1}{3}</math> because there are now <math>1</math> red chips and <math>3</math> total chips. If we multiply these fractions, we get <math>\frac{1}{10}</math>. To get the answer of <math>\frac{2}{5}</math> we need to multiply this product by <math>4</math> because there are <math>4</math> different draws that these red chips can be chosen on. They can be chosen on the <math>\text{1st 2nd, 3rd, or 4th}</math> draws because if a red chip was chosen on the <math>\text{5th}</math> draw, <math>2</math> green chips would have already been chosen. So our answer is <math>\frac{1}{10}</math> multiplied by <math>4</math> which would leave us with the answer of <math>\boxed{\textbf{(B) } \frac{2}{5}}</math>. | We can use basic probability to find the answer to this question. The probability of the first chip being red is <math>\frac{3}{5}</math> because there are <math>3</math> red chips and <math>5</math> chips in total. The probability of the second chip being red is <math>\frac{2}{4}</math> because there are now <math>2</math> red chips and <math>4</math> total chips. The probability of the third chip being red is <math>\frac{1}{3}</math> because there are now <math>1</math> red chips and <math>3</math> total chips. If we multiply these fractions, we get <math>\frac{1}{10}</math>. To get the answer of <math>\frac{2}{5}</math> we need to multiply this product by <math>4</math> because there are <math>4</math> different draws that these red chips can be chosen on. They can be chosen on the <math>\text{1st 2nd, 3rd, or 4th}</math> draws because if a red chip was chosen on the <math>\text{5th}</math> draw, <math>2</math> green chips would have already been chosen. So our answer is <math>\frac{1}{10}</math> multiplied by <math>4</math> which would leave us with the answer of <math>\boxed{\textbf{(B) } \frac{2}{5}}</math>. | ||
− | ~ | + | ~ThatCarGuy3 |
==Video Solution== | ==Video Solution== |
Revision as of 18:36, 26 March 2024
Contents
[hide]Problem
A top hat contains 3 red chips and 2 green chips. Chips are drawn randomly, one at a time without replacement, until all 3 of the reds are drawn or until both green chips are drawn. What is the probability that the 3 reds are drawn?
Solutions
Solution 1
We put five chips randomly in order and then pick the chips from the left to the right. To find the number of ways to rearrange the three red chips and two green chips, we solve for . However, we notice that whenever the last chip we draw is red, we pick both green chips before we pick the last red chip. Similarly, when the last chip is green, we pick all three red chips before the last green chip. This means that the last chip must be green in all the situations that work. This means we are left with finding the number of ways to rearrange three red chips and one green chip, which is . Because a green chip will be last out of the situations, our answer is .
Solution 2
There are two ways of ending the game: either you picked out all the red chips or you picked out all the green chips. We can pick out red chips, red chips and green chip, green chips, green chips and red chip, and green chips and red chips. Because order is important in this problem, there are ways to pick out the chip. But we noticed that if you pick out the three red chips before you pick out the green chip, the game ends. So, we need to subtract cases like that to get the total number of ways a game could end, which is . Out of the 10 ways to end the game, 4 of them end with a green chip. The answer is .
~CHECKMATE2021
Solution 3
Assume that after you draw the three red chips in a row without drawing both green chips, you continue drawing for the next turn. The last/fifth chip that is drawn must be a green chip because if both green chips were drawn before, we would've already completed the game. So technically, the problem is asking for the probability that the "fifth draw" is a green chip. This probability is symmetric to the probability that the first chip drawn is green, which is . So the probability is .
Note: This problem is almost identical to 2001 AMC 10 Problem #23.
CHECKMATE2021
Solution 4
If we list all possibilities where the red chips are drawn , where R represents Red and G represents Green, they are RRR, GRRR, RGRR, and RRGR, because the last chip drawn must be red. This means that there are 4 possibilities for it to be red. The only other outcome is that it ends in green, which if we represent them the same way we did for red, we get, GG, GRG, RGG, RRGG, RGRG, and GRRG, or outcomes. This means there are possible outcomes, and 4 outcomes that result in red being drawn, so the probability is , and the answer is
~CHECKMATE2021
Solution 5
We can use basic probability to find the answer to this question. The probability of the first chip being red is because there are red chips and chips in total. The probability of the second chip being red is because there are now red chips and total chips. The probability of the third chip being red is because there are now red chips and total chips. If we multiply these fractions, we get . To get the answer of we need to multiply this product by because there are different draws that these red chips can be chosen on. They can be chosen on the draws because if a red chip was chosen on the draw, green chips would have already been chosen. So our answer is multiplied by which would leave us with the answer of .
~ThatCarGuy3
Video Solution
~Education, the Study of Everything
See Also
2016 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 20 |
Followed by Problem 22 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.