2002 AMC 8 Problems/Problem 21: Difference between revisions
No edit summary |
Silverfang (talk | contribs) |
||
| Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
Case 1: There are two heads, two tails. The number of ways to choose which two tosses are | Case 1: There are two heads, two tails. The number of ways to choose which two tosses are heads is <math>_4 C _2 = 6</math>, and the other two must be tails. | ||
Case 2: There are three heads, one tail. There are <math>_4 C _1 = 4</math> ways to choose which of the four tosses is a tail. | Case 2: There are three heads, one tail. There are <math>_4 C _1 = 4</math> ways to choose which of the four tosses is a tail. | ||
Revision as of 11:08, 26 December 2013
Problem
Harold tosses a nickel four times. The probability that he gets at least as many heads as tails is
Solution
Case 1: There are two heads, two tails. The number of ways to choose which two tosses are heads is
, and the other two must be tails.
Case 2: There are three heads, one tail. There are
ways to choose which of the four tosses is a tail.
Case 3: There are four heads, no tails. This can only happen
way.
There are a total of
possible configurations, giving a probability of
.
See Also
| 2002 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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing