Difference between revisions of "2010 AIME II Problems/Problem 13"
(→Solution) |
m (Semi-automated contest formatting - script by azjps) |
||
Line 1: | Line 1: | ||
− | == Problem | + | == Problem == |
− | The <math>52</math> cards in a deck are numbered <math>1, 2, \cdots, 52</math>. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let <math>p(a)</math> be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards <math>a</math> and <math>a+9</math>, and Dylan picks the other of these two cards. The minimum value of <math>p(a)</math> for which <math>p(a)\ge\frac{1}{2}</math> can be written as <math>\frac{m}{n}</math>. where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>. | + | The <math>52</math> cards in a deck are numbered <math>1, 2, \cdots, 52</math>. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let <math>p(a)</math> be the [[probability]] that Alex and Dylan are on the same team, given that Alex picks one of the cards <math>a</math> and <math>a+9</math>, and Dylan picks the other of these two cards. The minimum value of <math>p(a)</math> for which <math>p(a)\ge\frac{1}{2}</math> can be written as <math>\frac{m}{n}</math>. where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>. |
− | |||
== Solution == | == Solution == | ||
− | + | Clearly <math>p(a)</math> is a [[quadratic]] centered at <math>a=22</math>. | |
− | Clearly <math>p(a)</math> is a quadratic centered at <math>a=22</math>. | ||
Once the two cards are drawn, there are <math>\dbinom{50}{2} = 1225</math> ways for the other two people to draw. | Once the two cards are drawn, there are <math>\dbinom{50}{2} = 1225</math> ways for the other two people to draw. | ||
Line 23: | Line 21: | ||
Let <math>a=22+b</math> | Let <math>a=22+b</math> | ||
− | < | + | <cmath>\begin{align*}(43-a)(42-a)+(a-1)(a-2)&=(21-b)(20-b)+(21+b)(20+b)=2b^2+2(21)(20)\ge (1225) \\ |
+ | b^2\ge \frac{385}{2} &= 192.5 >13^2 \end{align*}</cmath> | ||
− | <math>b | + | So <math>b&> 13</math> or <math>b< -13</math>, and <math>a=22+b<9</math> or <math>a>35</math>, so <math>a=8</math> or <math>a=36</math>. |
− | + | Thus, <math>p(8) = \frac{616}{1225} = \frac{88}{175}</math>, and the answer is <math>\boxed{263}</math>. | |
− | |||
− | |||
− | |||
− | |||
== See also == | == See also == | ||
{{AIME box|year=2010|num-b=12|num-a=14|n=II}} | {{AIME box|year=2010|num-b=12|num-a=14|n=II}} | ||
+ | |||
+ | [[Category:Intermediate Combinatorics Problems]] |
Revision as of 11:02, 6 April 2010
Problem
The cards in a deck are numbered . Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards and , and Dylan picks the other of these two cards. The minimum value of for which can be written as . where and are relatively prime positive integers. Find .
Solution
Clearly is a quadratic centered at .
Once the two cards are drawn, there are ways for the other two people to draw.
Alex and Dylan are the team with higher numbers if Blair and Corey both draw below , which occurs in ways.
Alex and Dylan are the team with lower numbers if Blair and Corey both draw above , which occurs in ways.
Thus,
We can look at as
So we need
Let
So $b&> 13$ (Error compiling LaTeX. Unknown error_msg) or , and or , so or .
Thus, , and the answer is .
See also
2010 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |