2010 AIME I Problems/Problem 14
Contents
[hide]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 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
The sum will contain some 4's, 3's and 2's. 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,
. Unless
is a divisor of
, we have $$ (Error compiling LaTeX. Unknown error_msg)M = \left\lfloor\frac{10000}{n}\right\rfloor
M + \left\lfloor \frac{M}{10} \right\rfloor = 100
M = 91
10000
91
n
109
n = 110
M + N < 100
n
109$.
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 |