Difference between revisions of "2015 AIME I Problems/Problem 12"
(→Solution) |
|||
Line 12: | Line 12: | ||
==Solution== | ==Solution== | ||
Let <math>M</math> be the desired mean. Then because <math>\dbinom{2015}{1000}</math> subsets have 1000 elements and <math>\dbinom{2015 - i}{999}</math> have <math>i</math> as their least element, | Let <math>M</math> be the desired mean. Then because <math>\dbinom{2015}{1000}</math> subsets have 1000 elements and <math>\dbinom{2015 - i}{999}</math> have <math>i</math> as their least element, | ||
+ | <cmath> | ||
\begin{align*} | \begin{align*} | ||
\binom{2015}{1000} M &= 1 \cdot \binom{2014}{999} + 2 \cdot \binom{2013}{999} + \dots + 1016 \cdot \binom{999}{999} \\ | \binom{2015}{1000} M &= 1 \cdot \binom{2014}{999} + 2 \cdot \binom{2013}{999} + \dots + 1016 \cdot \binom{999}{999} \\ | ||
− | &= \binom{2014} | + | &= \binom{2014}{999} + \binom{2013}{999} + \dots + \binom{999}{999} \\ |
& + \binom{2013}{999} + \binom{2012}{999} + \dots + \binom{999}{999} \\ | & + \binom{2013}{999} + \binom{2012}{999} + \dots + \binom{999}{999} \\ | ||
& \dots \\ | & \dots \\ | ||
Line 21: | Line 22: | ||
&= \binom{2016}{1001}. | &= \binom{2016}{1001}. | ||
\end{align*} | \end{align*} | ||
+ | </cmath> | ||
Using the definition of binomial coefficient and the identity <math>n! = n \cdot (n-1)!</math>, we deduce that | Using the definition of binomial coefficient and the identity <math>n! = n \cdot (n-1)!</math>, we deduce that | ||
<cmath>M = \frac{2016}{1001} = \frac{288}{143}.</cmath> | <cmath>M = \frac{2016}{1001} = \frac{288}{143}.</cmath> |
Revision as of 17:46, 20 March 2015
Contents
Problem
Consider all 1000-element subsets of the set {1, 2, 3, ... , 2015}. From each such subset choose the least element. The arithmetic mean of all of these least elements is , where and are relatively prime positive integers. Find .
Hint
Use the Hockey Stick Identity in the form
(This is best proven by a combinatorial argument that coincidentally pertains to the problem: count two ways the number of subsets of the first numbers with elements whose least element is , for .)
Solution
Let be the desired mean. Then because subsets have 1000 elements and have as their least element, Using the definition of binomial coefficient and the identity , we deduce that The answer is
See also
2015 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
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.