2007 AIME II Problems/Problem 7: Difference between revisions
Kingsave3166 (talk | contribs) |
Kingsave3166 (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
Find the maximum value of <math>\frac{n_{i}}{k}</math> for <math>1\leq i \leq 70.</math> | Find the maximum value of <math>\frac{n_{i}}{k}</math> for <math>1\leq i \leq 70.</math> | ||
== Solution 1== | ==Solution== | ||
=== Solution 1=== | |||
For <math>x = 1</math>, we see that <math>\sqrt[3]{1} \ldots \sqrt[3]{7}</math> all work, giving 7 integers. For <math>x=2</math>, we see that in <math>\sqrt[3]{8} \ldots \sqrt[3]{26}</math>, all of the [[even]] numbers work, giving 10 integers. For <math>x = 3</math>, we get 13, and so on. We can predict that at <math>x = 22</math> we get 70. | For <math>x = 1</math>, we see that <math>\sqrt[3]{1} \ldots \sqrt[3]{7}</math> all work, giving 7 integers. For <math>x=2</math>, we see that in <math>\sqrt[3]{8} \ldots \sqrt[3]{26}</math>, all of the [[even]] numbers work, giving 10 integers. For <math>x = 3</math>, we get 13, and so on. We can predict that at <math>x = 22</math> we get 70. | ||
| Line 11: | Line 12: | ||
The maximum value of <math>n_i = (x + 1)^3 - 1</math>. Therefore, the solution is <math>\frac{23^3 - 1}{22} = \frac{(23 - 1)(23^2 + 23 + 1)}{22} = 529 + 23 + 1 = 553</math>. | The maximum value of <math>n_i = (x + 1)^3 - 1</math>. Therefore, the solution is <math>\frac{23^3 - 1}{22} = \frac{(23 - 1)(23^2 + 23 + 1)}{22} = 529 + 23 + 1 = 553</math>. | ||
==Solution 2== | ===Solution 2=== | ||
Obviously <math>k</math> is positive. Then, we can let <math>n_1</math> equal <math>k^3</math> and similarly let <math>n_i</math> equal <math>k^3 + (i - 1)k</math>. | Obviously <math>k</math> is positive. Then, we can let <math>n_1</math> equal <math>k^3</math> and similarly let <math>n_i</math> equal <math>k^3 + (i - 1)k</math>. | ||
Revision as of 13:17, 13 March 2015
Problem
Given a real number
let
denote the greatest integer less than or equal to
For a certain integer
there are exactly
positive integers
such that
and
divides
for all
such that
Find the maximum value of
for
Solution
Solution 1
For
, we see that
all work, giving 7 integers. For
, we see that in
, all of the even numbers work, giving 10 integers. For
, we get 13, and so on. We can predict that at
we get 70.
To prove this, note that all of the numbers from
divisible by
work. Thus,
(the one to be inclusive) integers will fit the conditions.
.
The maximum value of
. Therefore, the solution is
.
Solution 2
Obviously
is positive. Then, we can let
equal
and similarly let
equal
.
The wording of this problem (which uses "exactly") tells us that
. Taking away
from our inequality results in
. Since
,
, and
are all integers, this inequality is equivalent to
. Since
is positive, we can divide the inequality by
to get
. Clearly the only
that satisfies is
.
Then,
is the maximum value of
. (Remember we set
equal to
!)
See also
| 2007 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.