2010 AIME I Problems/Problem 14
Contents
Problem
For each positive integer n, let . Find the largest value of n for which .
Note: is the greatest integer less than or equal to .
Solution
Solution 1
Observe that is strictly increasing in . We realize that we need terms to add up to around , so we need some sequence of s, s, and then s.
It follows that . Manually checking shows that and . Thus, our answer is .
Solution 2
Because we want the value for which , the average value of the 100 terms of the sequence should be around . For the value of to be , . We want kn to be around the middle of that range, and for k to be in the middle of 0 and 100, let , so , and . , so we want to lower . Testing yields , so our answer is still .
Solution 3
For any where the sum is close to , all the terms in the sum must be equal to , or . Let be the number of terms less than or equal to and be the number of terms equal to (also counted in ). With this definition of and the total will be , from which . Now is the smallest integer for which or , thus Similarly,
Therefore, Since we want the largest possible , the answer is .
Solution 4 (Similar to Solution 1, but with more detail)
Since we're working with base- logarithms, we can start by testing out 's that are powers of . For , the terms in the sum are . For numbers -, . Then we have numbers, namely -, for which . The last number we have is , which gives us . This sum gives us only , which is much too low. However, applying the same counting technique for , our sum comes out to be , since there are terms for which , terms for which , and one term for which . So we go up one more power of and get , which is very close to what we are looking for.
Now we only have to bump up the value of a bit and check our sum. Each increase in by actually increases the value of our sum by as well (except for ), because whenever a is added to the sum, a is taken away. It doesn't take long to check and see that the value of we're looking for is , which corresponds to a sum of exactly .
~ anellipticcurveoverq
See Also
2010 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
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.