Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2015 AIME I Problems/Problem 2"

(→‎Solution 3)
(→‎Solution 2)
Line 10: Line 10:
  
 
Thus, the fraction is <math>\frac{7+18+30}{84} = \frac{55}{84}</math>. Since this does not reduce, the answer is <math>55+84=\boxed{139}</math>.
 
Thus, the fraction is <math>\frac{7+18+30}{84} = \frac{55}{84}</math>. Since this does not reduce, the answer is <math>55+84=\boxed{139}</math>.
−
 
−
==Solution 2==
 
−
 
−
The total number of ways to pick <math>3</math> officials from <math>9</math> total is <math>84</math>. We note that two sleepers are asleep and one is awake if and only if the sleepers come from two distinct countries. The sleeping officials can be from either <math>1</math>, <math>2</math>, or <math>3</math> countries.
 
−
 
−
* If the sleeping officials are from a single country, they can be from Canada in <math>1</math> way and from the United States in <math>4</math> ways, so there are <math>5</math> total possibilities.
 
−
 
−
* If the sleeping officials are from <math>3</math> different countries, there must be one from each. So there are <math>2 \cdot 3 \cdot 4 = 24</math> total possibilities.
 
−
 
−
Out of <math>84</math> total, <math>5+24=29</math> possibilities are different from the case we are looking for, so there are <math>84-29=55</math> total ways to choose 22 officials from one country and a single official from another country. As <math>55</math> and <math>84</math> share no common factors, we have <math>55+84=\boxed{139}</math>.
 
  
 
== See also ==
 
== See also ==

Revision as of 18:13, 16 December 2020

Problem

The nine delegates to the Economic Cooperation Conference include $2$ officials from Mexico, $3$ officials from Canada, and $4$ 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 $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

The total number of ways to pick $3$ officials from $9$ total is $\binom{9}{3} = 84$, which will be our denominator. Now we can consider the number of ways for exactly two sleepers to be from the same country for each country individually and add them to find our numerator:

  • There are $7$ different ways to pick $3$ delegates such that $2$ are from Mexico, simply because there are $9-2=7$ "extra" delegates to choose to be the third sleeper once both from Mexico are sleeping.
  • There are $3\times6=18$ ways to pick from Canada, as each Canadian can be left out once and each time one is left out there are $9-3=6$ "extra" people to select one more sleeper from.
  • Lastly, there are $6\times5=30$ ways to choose for the United States. It is easy to count $6$ different ways to pick $2$ of the $4$ Americans, and each time you do there are $9-4=5$ officials left over to choose from.

Thus, the fraction is $\frac{7+18+30}{84} = \frac{55}{84}$. Since this does not reduce, the answer is $55+84=\boxed{139}$.

See also

2015 AIME I (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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_AIME_I_Problems/Problem_2&oldid=139829"