For some nonzero integer N , the equation: x 3 − 2 0 1 7 x + N = 0 has the three integer roots p , q and r .
Find ∣ p ∣ + ∣ q ∣ + ∣ r ∣ .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How did you get the roots from the last form of the equation?
Log in to reply
The simplest way to find the positive integer roots of u 2 + 3 v 2 = 8 0 6 8 is trial and error! Since 3 v 2 < 8 0 6 8 , we have 1 ≤ v ≤ 5 1 . Just find which of 8 0 6 8 − 3 v 2 are perfect squares.
A more elegant method is to consider the Euclidean domain Z [ ω ] , where ω = e 3 2 π i is a primitive cube root of unity. Then the distance function on this Euclidean domain is N ( a + b ω ) = ∣ a + b ω ∣ 2 = a 2 − a b + b 2 Since 2 0 1 7 = ∣ 4 8 + 7 ω ∣ 2 , then the only prime factors of 2 0 1 7 are ζ ( 4 8 ± 7 ω ) , where ζ is one of the units ± 1 , ± ω , ± ω 2 . This gives us the possible roots.
Please can you explain the elegant method to find roots.
Problem Loading...
Note Loading...
Set Loading...
If the roots are p , q , r , then p + q + r = 0 and p q + q r + p r = − 2 0 1 7 , where p , q , r are integers. Writing r = − p − q yields the equation p 2 + p q + q 2 = 2 0 1 7 or ( 2 p + q ) 2 + 3 q 2 = 8 0 6 8 It is clear from the last form of this equation that there are only finitely many possible solutions. These are { p , q } = { 7 , 4 1 } , { − 7 , − 4 1 } , { 7 , − 4 8 } , { − 7 , 4 8 } , { 4 1 , − 4 8 } , { − 4 1 , 4 8 } , which make the three roots either 7 , 4 1 , − 4 8 or − 7 , − 4 1 , 4 8 . Either way, the answer is 7 + 4 1 + 4 8 = 9 6 .