Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1986 AIME Problems/Problem 5"

(→‎Solution 2)
m (Fixed LaTeX and separated the two solution approaches)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 
What is that largest [[positive integer]] <math>n</math> for which <math>n^3+100</math> is [[divisible]] by <math>n+10</math>?
 
What is that largest [[positive integer]] <math>n</math> for which <math>n^3+100</math> is [[divisible]] by <math>n+10</math>?
−
== Solution ==
 
−
If <math>n+10 \mid n^3+100</math>, <math>\gcd(n^3+100,n+10)=n+10</math>. Using the [[Euclidean algorithm]], we have <math>\gcd(n^3+100,n+10)= \gcd(-10n^2+100,n+10)</math> <math>= \gcd(100n+100,n+10)</math> <math>= \gcd(-900,n+10)</math>, so <math>n+10</math> must divide 900. The greatest [[integer]] <math>n</math> for which <math>n+10</math> divides 900 is 890; we can double-check manually and we find that indeed <math>900 \mid 890^3+100</math>.
 
  
 +
== Solution 1 ==
 +
If <math>n+10 \mid n^3+100</math>, <math>\gcd(n^3+100,n+10)=n+10</math>. Using the [[Euclidean algorithm]], we have <math>\gcd(n^3+100,n+10)= \gcd(-10n^2+100,n+10)</math> <math>= \gcd(100n+100,n+10)</math> <math>= \gcd(-900,n+10)</math>, so <math>n+10</math> must divide <math>900</math>. The greatest [[integer]] <math>n</math> for which <math>n+10</math> divides <math>900</math> is <math>\boxed{890}</math>; we can double-check manually and we find that indeed <math>900 \mid 890^3+100</math>.
 +
 +
== Solution 2 ==
 
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>.
  

Revision as of 21:43, 2 April 2018

Problem

What is that largest positive integer $n$ for which $n^3+100$ is divisible by $n+10$?

Solution 1

If $n+10 \mid n^3+100$, $\gcd(n^3+100,n+10)=n+10$. Using the Euclidean algorithm, we have $\gcd(n^3+100,n+10)= \gcd(-10n^2+100,n+10)$ $= \gcd(100n+100,n+10)$ $= \gcd(-900,n+10)$, so $n+10$ must divide $900$. The greatest integer $n$ for which $n+10$ divides $900$ is $\boxed{890}$; we can double-check manually and we find that indeed $900 \mid 890^3+100$.

Solution 2

In a similar manner, we can apply synthetic division. We are looking for $\frac{n^3 + 100}{n + 10} = n^2 - 10n - 100 - \frac{900}{n + 10}$. Again, $n + 10$ must be a factor of $900 \Longrightarrow n = \boxed{890}$.


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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1986_AIME_Problems/Problem_5&oldid=93742"