Find d when d|n2+n-2, d|n3+2n-1 & d=1 (mod 2), d > 1

Click For Summary
SUMMARY

The discussion centers on finding the greatest common divisor (GCD) denoted as d for the expressions n² + n - 2 and n³ + 2n - 1, under the conditions that d = 1 (mod 2) and d > 1. The user seeks clarification on how the professor derived the expression d | n³ + n² - 2n from the initial conditions. The user recognizes that n³ + n² - 2n can be factored as n(n² + n - 2), which is divisible by d, confirming the professor's assertion.

PREREQUISITES
  • Understanding of GCD and divisibility rules
  • Familiarity with polynomial factorization
  • Knowledge of modular arithmetic, specifically mod 2
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study GCD properties in number theory
  • Learn about polynomial divisibility and factorization techniques
  • Explore modular arithmetic applications in algebra
  • Investigate advanced topics in algebraic structures, such as rings and fields
USEFUL FOR

Students studying algebra, particularly those focusing on number theory and polynomial functions, as well as educators looking for examples of GCD applications in mathematical problems.

kuahji
Messages
390
Reaction score
2
Let d=GCD(n2+n-2,n3+2n-1). Find d if d=1(mod 2) & d > 1.

So we know d|n2+n-2 & d|n3+2n-1.

My question is simply this, the professor wrote down hence d|n3+n2-2n, right after what is written above. But I'm just not seeing how you get that combination. I understand how to work the problem, just not that one step & I'm probably just over-looking something really simple.
 
Physics news on Phys.org
[itex]n^3 + n^2 - 2n = n(n^2 + n -2)[/itex]
and d|(n^2 + n - 2)

But this is probably the wrong subforum for that question.
 
Yes, I meant to post in under homework. I must have been surfing too many forums at once. Thanks though! I knew it was something silly.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
803
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 25 ·
Replies
25
Views
4K