Difference between revisions of "2009 AIME I Problems/Problem 3"

(Solution)
(Solution)
Line 5: Line 5:
 
== Solution ==
 
== Solution ==
  
If we let the odds of a tails equal <math>t</math>, then the probability of three heads and five tails is <math>28{p^3}{t^5}</math>
+
The probability of three heads and five tails is <math>\binom {8}{3}p^3(1-p)^5</math> and the probability of five heads and three tails is <math>\binom {8}{3}p^5(1-p)^3</math>.
The probability of five heads and three tails is <math>28{p^5}{t^3}</math>
 
  
<cmath>25*28{p^3}{t^5} = 28{p^5}{t^3}</cmath>
+
<cmath>\begin{align*}
<cmath>25{t^2} = {p^2}</cmath>
+
25\binom {8}{3}p^3(1-p)^5&=\binom {8}{3}p^5(1-p)^3 \\
<cmath>5t = p</cmath>
+
25(1-p)^2&=p^2 \\
<cmath>5(1 - p) = p</cmath>
+
5(1-p)&=p \\
<cmath>5 - 5p = p</cmath>
+
5-5p&=p \\
<cmath>5 = 6p</cmath>
+
5&=6p \\
<cmath>p = \frac {5} {6}</cmath>
+
p&=\frac {5}{6}\end{align*}</cmath>
<cmath>5 + 6 = \boxed{11}</cmath>
+
 
 +
Therefore, the answer is <math>5+6=\boxed{11}</math>.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2009|n=I|num-b=2|num-a=4}}
 
{{AIME box|year=2009|n=I|num-b=2|num-a=4}}

Revision as of 17:36, 26 March 2009

Problem

A coin that comes up heads with probability $p > 0$ and tails with probability $1 - p > 0$ independently on each flip is flipped eight times. Suppose the probability of three heads and five tails is equal to $\frac {1}{25}$ of the probability of five heads and three tails. Let $p = \frac {m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Solution

The probability of three heads and five tails is $\binom {8}{3}p^3(1-p)^5$ and the probability of five heads and three tails is $\binom {8}{3}p^5(1-p)^3$.

\begin{align*} 25\binom {8}{3}p^3(1-p)^5&=\binom {8}{3}p^5(1-p)^3 \\ 25(1-p)^2&=p^2 \\ 5(1-p)&=p \\ 5-5p&=p \\ 5&=6p \\ p&=\frac {5}{6}\end{align*}

Therefore, the answer is $5+6=\boxed{11}$.

See also

2009 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 2
Followed by
Problem 4
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions