Difference between revisions of "1986 AIME Problems/Problem 5"
Ilovepi3.14 (talk | contribs) (→Solution 2) |
Ilovepi3.14 (talk | contribs) (→Solution 2) |
||
Line 6: | Line 6: | ||
In a similar manner, we can apply synthetic division. We are looking for <math>\frac{n^3 + 100}{n + 10} = n^2 - 10n - 100 - \frac{900}{n + 10}</math>. Again, <math>n + 10</math> must be a factor of <math>900 \Longrightarrow n = \boxed{890}</math>. | In a similar manner, we can apply synthetic division. We are looking for <math>\frac{n^3 + 100}{n + 10} = n^2 - 10n - 100 - \frac{900}{n + 10}</math>. Again, <math>n + 10</math> must be a factor of <math>900 \Longrightarrow n = \boxed{890}</math>. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== See also == | == See also == |
Revision as of 00:34, 31 January 2018
Problem
What is that largest positive integer for which is divisible by ?
Solution
If , . Using the Euclidean algorithm, we have , so must divide 900. The greatest integer for which divides 900 is 890; we can double-check manually and we find that indeed .
In a similar manner, we can apply synthetic division. We are looking for . Again, must be a factor of .
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.