1991 AIME Problems/Problem 6
Revision as of 18:21, 4 July 2013 by Nathan wailes (talk | contribs)
Problem
Suppose
is a real number for which
Find
. (For real
,
is the greatest integer less than or equal to
.)
Solution
There are
numbers in the sequence. Since
can be at most
apart, all of the numbers in the sequence can take one of two possible values. Since
, the numbers must be either
or
. As the remainder is
,
must take on
of the values, with
being the value of the remaining
numbers. The 39th number is
, and so
. Solving shows that
, so
.
See also
| 1991 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 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.