Difference between revisions of "2000 AIME II Problems/Problem 7"
m |
|||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | {{ | + | Mutiplying each side by <math>19!</math>, We have <center><math>\binom{19}{2}+\binom{19}{3}+\binom{19}{4}+\binom{19}{5}+\binom{19}{6}+\binom{19}{7}+\binom{19}{8}+\binom{19}{9}=19N</math></center> Since we know that <center><math>\binom{19}{0}+\binom{19}{1}+...+\binom{19}{9}=\frac{1}{2}\cdot(2^{19})=2^{18}</math> |
− | + | </center> Hence, we know that the above equation equates to | |
== See also == | == See also == | ||
{{AIME box|year=2000|n=II|num-b=6|num-a=8}} | {{AIME box|year=2000|n=II|num-b=6|num-a=8}} |
Revision as of 07:16, 25 February 2008
Problem
Given that
find the greatest integer that is less than .
Solution
Mutiplying each side by , We have
Since we know that
Hence, we know that the above equation equates to
See also
2000 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |