Difference between revisions of "2000 AMC 8 Problems/Problem 21"
(Tag: Undo) |
|||
(9 intermediate revisions by 7 users not shown) | |||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
+ | Divide it into <math>2</math> cases: | ||
+ | |||
+ | 1) Keiko and Ephriam both get <math>0</math> heads: | ||
+ | This means that they both roll all tails, so there is only <math>1</math> way for this to happen. | ||
+ | |||
+ | 2) Keiko and Ephriam both get <math>1</math> head: | ||
+ | For Keiko, there is only <math>1</math> way for this to happen because he is only flipping 1 penny, but for Ephriam, there are 2 ways since there are <math>2</math> choices for when he can flip the head. So, in total there are <math>2 \cdot 1 = 2</math> ways for this case. | ||
+ | |||
+ | Thus, in total there are <math>3</math> ways that work. Since there are <math>2</math> choices for each coin flip (Heads or Tails), there are <math>2^3 = 8</math> total ways of flipping 3 coins. | ||
+ | |||
+ | Thus, since all possible coin flips of 3 coins are equally likely, the probability is <math>\boxed{(B) \frac38}</math>. | ||
+ | |||
+ | ==Solution 2== | ||
Let <math>K(n)</math> be the probability that Keiko gets <math>n</math> heads, and let <math>E(n)</math> be the probability that Ephriam gets <math>n</math> heads. | Let <math>K(n)</math> be the probability that Keiko gets <math>n</math> heads, and let <math>E(n)</math> be the probability that Ephriam gets <math>n</math> heads. | ||
Line 21: | Line 34: | ||
<math>E(2) = \frac{1}{2}\cdot\frac{1}{2} = \frac{1}{4}</math> | <math>E(2) = \frac{1}{2}\cdot\frac{1}{2} = \frac{1}{4}</math> | ||
− | The probability that Keiko gets <math>0</math> heads and Ephriam gets <math>0</math> heads is <math>K(0)\cdot E(0)</math>. | + | The probability that Keiko gets <math>0</math> heads and Ephriam gets <math>0</math> heads is <math>K(0)\cdot E(0)</math>. Similarly for <math>1</math> head and <math>2</math> heads. Thus, we have: |
<math>P = K(0)\cdot E(0) + K(1)\cdot E(1) + K(2)\cdot E(2)</math> | <math>P = K(0)\cdot E(0) + K(1)\cdot E(1) + K(2)\cdot E(2)</math> | ||
− | <math>P = \frac{1}{2}\cdot\frac{1}{4} + \frac{1}{2}\cdot\frac{1}{2} + 0</math> | + | <math>P = \frac{1}{2}\cdot\frac{1}{4} + \frac{1}{2}\cdot\frac{1}{2} + 0\cdot\frac{1}{4}</math> |
<math>P = \frac{3}{8}</math> | <math>P = \frac{3}{8}</math> | ||
Thus the answer is <math>\boxed{B}</math>. | Thus the answer is <math>\boxed{B}</math>. | ||
+ | |||
+ | == Video Solution == | ||
+ | https://youtu.be/a_Tfeb_6dqE Soo, DRMS, NM | ||
+ | |||
+ | https://www.youtube.com/watch?v=mLrtRuJuYI4 ~David | ||
==See Also== | ==See Also== |
Latest revision as of 17:18, 27 October 2024
Problem
Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is
Solution
Divide it into cases:
1) Keiko and Ephriam both get heads: This means that they both roll all tails, so there is only way for this to happen.
2) Keiko and Ephriam both get head: For Keiko, there is only way for this to happen because he is only flipping 1 penny, but for Ephriam, there are 2 ways since there are choices for when he can flip the head. So, in total there are ways for this case.
Thus, in total there are ways that work. Since there are choices for each coin flip (Heads or Tails), there are total ways of flipping 3 coins.
Thus, since all possible coin flips of 3 coins are equally likely, the probability is .
Solution 2
Let be the probability that Keiko gets heads, and let be the probability that Ephriam gets heads.
(Keiko only has one penny!)
(because Ephraim can get HT or TH)
The probability that Keiko gets heads and Ephriam gets heads is . Similarly for head and heads. Thus, we have:
Thus the answer is .
Video Solution
https://youtu.be/a_Tfeb_6dqE Soo, DRMS, NM
https://www.youtube.com/watch?v=mLrtRuJuYI4 ~David
See Also
2000 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.