Solving for the Largest Positive Integer n

  • Thread starter Thread starter Trail_Builder
  • Start date Start date
  • Tags Tags
    Integer Positive
Click For Summary

Homework Help Overview

The problem involves finding the largest positive integer n such that n^3 + 100 is divisible by n + 10. This falls within the realm of algebra, specifically polynomial divisibility.

Discussion Character

  • Exploratory, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss using modular arithmetic and polynomial division techniques to analyze the divisibility condition. There are attempts to simplify the expression and check for remainders.

Discussion Status

Some participants have shared their reasoning and methods, with one suggesting a potential solution based on modular arithmetic. Others have confirmed the validity of the approach, indicating a productive exchange of ideas.

Contextual Notes

There is a hint regarding the use of modular arithmetic to simplify the problem, and participants express uncertainty about the effectiveness of their approaches. The discussion reflects varying levels of confidence in the reasoning presented.

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.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
9
Views
3K
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
5
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K