Difference between revisions of "2002 AMC 12A Problems/Problem 16"
Line 26: | Line 26: | ||
In all, there are <math>7+6+10+8+6+2+1=40</math> ways. Tina chooses two distinct numbers in <math>\binom{5}{2}=10</math> ways while Sergio chooses a number in <math>10</math> ways, so there are <math>10\cdot 10=100</math> ways in all. Since <math>\frac{40}{100}=\frac{2}{5}</math>, our answer is <math>\boxed{\text{(A)}\ 2/5}</math>. | In all, there are <math>7+6+10+8+6+2+1=40</math> ways. Tina chooses two distinct numbers in <math>\binom{5}{2}=10</math> ways while Sergio chooses a number in <math>10</math> ways, so there are <math>10\cdot 10=100</math> ways in all. Since <math>\frac{40}{100}=\frac{2}{5}</math>, our answer is <math>\boxed{\text{(A)}\ 2/5}</math>. | ||
− | An alternative way is to find the average of the smallest possible chance of Sergio winning and the largest possible chance of Sergio winning. This is because the probability decreases linearly. The largest possibility of Sergio winning if Tina chooses a 1 and a 2. The chances of Sergio winning is then <math> \frac{7}{10}</math> . The smallest possibility of Sergio winning is if Tina chooses a 4 and a 5. The chances of Sergio winning then is | + | An alternative way is to find the average of the smallest possible chance of Sergio winning and the largest possible chance of Sergio winning. This is because the probability decreases linearly. The largest possibility of Sergio winning if Tina chooses a 1 and a 2. The chances of Sergio winning is then <math> \frac{7}{10}</math> . The smallest possibility of Sergio winning is if Tina chooses a 4 and a 5. The chances of Sergio winning then is <math> \frac{1}{10}</math>. The average of <math> \frac{7}{10} </math> and <math> \frac{1}{10} </math> is <math>{frac{2}{5}</math>. |
==See Also== | ==See Also== |
Revision as of 23:06, 9 July 2011
- The following problem is from both the 2002 AMC 12A #16 and 2002 AMC 10A #24, so both problems redirect to this page.
Problem
Tina randomly selects two distinct numbers from the set {1, 2, 3, 4, 5}, and Sergio randomly selects a number from the set {1, 2, ..., 10}. What is the probability that Sergio's number is larger than the sum of the two numbers chosen by Tina?
Solution
This is not too bad using casework.
Tina gets a sum of 3: This happens in only one way (1,2) and Sergio can choose a number from 4 to 10, inclusive. There are 7 ways that Sergio gets a desirable number here.
Tina gets a sum of 4: This once again happens in only one way (1,3). Sergio can choose a number from 5 to 10, so 6 ways here.
Tina gets a sum of 5: This can happen in two ways (1,4) and (2,3). Sergio can choose a number from 6 to 10, so 2*5=10 ways here.
Tina gets a sum of 6: Two ways here (1,5) and (2,4). Sergio can choose a number from 7 to 10, so 2*4=8 here.
Tina gets a sum of 7: Two ways here (2,5) and (3,4). Sergio can choose from 8 to 10, so 2*3=6 ways here.
Tina gets a sum of 8: Only one way possible (3,5). Sergio chooses 9 or 10, so 2 ways here.
Tina gets a sum of 9: Only one way (4,5). Sergio must choose 10, so 1 way.
In all, there are ways. Tina chooses two distinct numbers in ways while Sergio chooses a number in ways, so there are ways in all. Since , our answer is .
An alternative way is to find the average of the smallest possible chance of Sergio winning and the largest possible chance of Sergio winning. This is because the probability decreases linearly. The largest possibility of Sergio winning if Tina chooses a 1 and a 2. The chances of Sergio winning is then . The smallest possibility of Sergio winning is if Tina chooses a 4 and a 5. The chances of Sergio winning then is . The average of and is ${frac{2}{5}$ (Error compiling LaTeX. ! Missing } inserted.).
See Also
2002 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
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 AMC 12 Problems and Solutions |
2002 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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 AMC 10 Problems and Solutions |