Difference between revisions of "1992 AHSME Problems/Problem 29"
(→Solution 2) |
(→Solution 2) |
||
(5 intermediate revisions by the same user not shown) | |||
Line 15: | Line 15: | ||
Denote <math>P_n</math> as the probability that the number of heads is even. Then we have two cases: | Denote <math>P_n</math> as the probability that the number of heads is even. Then we have two cases: | ||
− | + | <math>\bold{Case 1}</math>: (There are an odd number of heads for <math>(n-1)</math> coin flips). | |
Well to solve this case, we first ask the question; "What is the probability we get an odd number of heads for <math>(n-1)</math> flips?" That is precisely <math>1-P_{n-1}</math>. Now, since we want an even number of heads, what is the probability that on the <math>n-th</math> coin flip we get a head? <math>\frac{2}{3}</math>. So we have <math>\frac{2}{3}(1-P_{n-1})</math>. | Well to solve this case, we first ask the question; "What is the probability we get an odd number of heads for <math>(n-1)</math> flips?" That is precisely <math>1-P_{n-1}</math>. Now, since we want an even number of heads, what is the probability that on the <math>n-th</math> coin flip we get a head? <math>\frac{2}{3}</math>. So we have <math>\frac{2}{3}(1-P_{n-1})</math>. | ||
− | + | <math>\bold{Case 2}</math>: (There are an even number of heads for <math>(n-1)</math> coin flips). Since we now already have an even number of heads, we now want to flip and get a tail, or else the number of heads for <math>n</math> flips will be odd. :/ So what is the probability we get a tail? <math>1-\frac{2}{3}=\frac{1}{3}</math>. Thus we have <math>\frac{1}{3}(P_{n-1})</math>. | |
Adding both cases, we have that <math>P_n=\frac{2}{3}-\frac{1}{3}P_{n-1}</math>. Now doing some tedious casework because wolfram alpha cannot find a pattern, we get the same answer as in <math>\boxed {D)}</math>. | Adding both cases, we have that <math>P_n=\frac{2}{3}-\frac{1}{3}P_{n-1}</math>. Now doing some tedious casework because wolfram alpha cannot find a pattern, we get the same answer as in <math>\boxed {D)}</math>. | ||
Sorry for the very hand-wavy and non-rigorous answer! At least mine has a cool recurrence relation! :D | Sorry for the very hand-wavy and non-rigorous answer! At least mine has a cool recurrence relation! :D | ||
+ | |||
+ | (Or just come up with the general formula <math>P_n=\frac{1}{2}(1+\frac{1}{3^n})</math> Simple observation really. If you really want to get mathy, prove this through induction). | ||
~th1nq3r | ~th1nq3r |
Latest revision as of 18:29, 20 June 2021
Contents
Problem
An unfair coin has a probability of turning up heads. If this coin is tossed times, what is the probability that the total number of heads is even?
Solution
Doing casework on the number of heads (0 heads, 2 heads, 4 heads...), we get the equation This is essentially the expansion of but without the odd power terms. To get rid of the odd power terms in , we add and then divide by because the even power terms that were not canceled were expressed twice. Thus, we have Or which is equivalent to answer choice .
Solution 2
Denote as the probability that the number of heads is even. Then we have two cases:
: (There are an odd number of heads for coin flips). Well to solve this case, we first ask the question; "What is the probability we get an odd number of heads for flips?" That is precisely . Now, since we want an even number of heads, what is the probability that on the coin flip we get a head? . So we have .
: (There are an even number of heads for coin flips). Since we now already have an even number of heads, we now want to flip and get a tail, or else the number of heads for flips will be odd. :/ So what is the probability we get a tail? . Thus we have .
Adding both cases, we have that . Now doing some tedious casework because wolfram alpha cannot find a pattern, we get the same answer as in .
Sorry for the very hand-wavy and non-rigorous answer! At least mine has a cool recurrence relation! :D
(Or just come up with the general formula Simple observation really. If you really want to get mathy, prove this through induction).
~th1nq3r
See also
1992 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 28 |
Followed by Problem 30 | |
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 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.