2000 AIME II Problems/Problem 7
Problem
Given that
find the greatest integer that is less than
.
Solution
Multiplying both sides by
yields:
Recall the Combinatorial Identity
. Since
, it follows that
.
Thus,
.
So,
and
.
Solution 2
Let
Applying the binomial theorem gives us
Since
After some fairly easy bashing, we get
as the answer.
~peelybonehead
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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing