Difference between revisions of "2015 AIME I Problems/Problem 2"
(Created page with "The nine delegates to the Economic Cooperation Conference include <math>2</math> officials from Mexico, <math>3</math> officials from Canada, and <math>4</math> officials from...") |
Flamedragon (talk | contribs) |
||
| Line 1: | Line 1: | ||
The nine delegates to the Economic Cooperation Conference include <math>2</math> officials from Mexico, <math>3</math> officials from Canada, and <math>4</math> officials from the United States. During the opening session, three of the delegates fall asleep. Assuming that the three sleepers were determined randomly, the probability that exactly two of the sleepers are from the same country is <math>\frac{m}{n}</math>, where m and n are relatively prime positive integers. Find <math>m+n</math>. | The nine delegates to the Economic Cooperation Conference include <math>2</math> officials from Mexico, <math>3</math> officials from Canada, and <math>4</math> officials from the United States. During the opening session, three of the delegates fall asleep. Assuming that the three sleepers were determined randomly, the probability that exactly two of the sleepers are from the same country is <math>\frac{m}{n}</math>, where m and n are relatively prime positive integers. Find <math>m+n</math>. | ||
| + | |||
| + | == See also == | ||
| + | {{AIME box|year=2015|num-b=1|num-a=3}} | ||
| + | {{MAA Notice}} | ||
| + | [[Category:Introductory Geometry Problems]] | ||
Revision as of 12:22, 20 March 2015
The nine delegates to the Economic Cooperation Conference include 
officials from Mexico, 
officials from Canada, and 
officials from the United States. During the opening session, three of the delegates fall asleep. Assuming that the three sleepers were determined randomly, the probability that exactly two of the sleepers are from the same country is 
, where m and n are relatively prime positive integers. Find 
.
See also
| 2015 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
