Solving for the Largest Positive Integer n

  • Thread starter Thread starter Trail_Builder
  • Start date Start date
  • Tags Tags
    Integer Positive
Trail_Builder
Messages
148
Reaction score
0

Homework Statement



Find the largest positive integer n such that n^3 + 100 is divisible by n + 10.

Homework Equations





The Attempt at a Solution



The hint I've been given is to use (mod n + 10) to get rid of the n.

but i don't quite see how it would work :S

all my attempts have gotten nowhere, lol.

a little prod in the right direction would be nice :)

cheers
 
Physics news on Phys.org
My method would be to just use any polynomial dividing technique to find the remainder of (n^3+100)/(n+10). If n^3+100 is divisible by n+10, then the remainder will have to be an integer.
 
right, i think i may have a solution to this problem. can someone please check it for me :) thanks.


say that n^3 + 100 is divisible by n + 10.

then n^3 + 100 = 0 (mod n + 10)

n = -10 (mod n + 10)

so (-10)^3 + 100 = 0 (mod n + 10)

... 0 = 900 (mod n + 10)

we want to maximise n, and because the above line essentially means that 900 is an integer multiple of (n + 10), the maximum n would be when 900 = n +10

so n = 890...


is this reasoning correct?

thanks:)
 
Looks good to me:approve: I got the same thing using polynomial division.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top