Difference between revisions of "1986 AIME Problems/Problem 5"
Mathlete0001 (talk | contribs) m (→Problem) |
Mzheng2025 (talk | contribs) (Added another solution) |
||
Line 32: | Line 32: | ||
~asops | ~asops | ||
+ | |||
+ | ==Solution 6 (Easiest Factor)== | ||
+ | In the problem, we can see that <math>n^3 + 100</math> has a cube. Immediately think of sum of cubes, which leads us to add 900, resulting in <math>(n^3 + 10^3) - 900</math> --> <math>(n+10)(n^2 - 10n + 100) - 900</math>. Since the <math>(n+10)(n^2 - 10n + 100)</math> contains <math>(n+10)</math>, this part is divisible by <math>n+10</math> --> therefore the 900 must be divisible by <math>n+10</math>. The largest <math>n</math> that satisfies this is <math>900-10 = \boxed{890}</math>. | ||
== See also == | == See also == |
Latest revision as of 21:19, 29 April 2025
Contents
Problem
What is the largest positive integer for which
is divisible by
?
Video Solution by OmegaLearn
https://youtu.be/zfChnbMGLVQ?t=1458
~ pi_is_3.14
~ momeme
Solution 1
If ,
. Using the Euclidean algorithm, we have
, so
must divide
. The greatest integer
for which
divides
is
; we can double-check manually and we find that indeed
.
Solution 2 (Simple)
Let , then
. Then
Therefore,
must be divisible by
, which is largest when
and
Solution 3
In a similar manner, we can apply synthetic division. We are looking for . Again,
must be a factor of
.
Solution 4
The key to this problem is to realize that for all
. Since we are asked to find the maximum possible
such that
, we have:
. This is because of the property that states that if
and
, then
. Since, the largest factor of 900 is itself we have:
~qwertysri987
Solution 5 (Easy Modular Arithmetic)
Notice that . Therefore
~asops
Solution 6 (Easiest Factor)
In the problem, we can see that has a cube. Immediately think of sum of cubes, which leads us to add 900, resulting in
-->
. Since the
contains
, this part is divisible by
--> therefore the 900 must be divisible by
. The largest
that satisfies this is
.
See also
1986 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
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.