1 1 + 2 n − n 2 n 3 − 1 2 n 2 + 8 n + 9 3 = p
Let n be some integer, satisfying the above equation, yielding a prime integer p .
What is the sum of all possible values of p ?
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.
I guess you also should check n = − 1 7 , for which the fraction is 0 , also an integer.
In order to narrow down the applicable n , let us first solve for the polynomial quotient and remainder:
p = 1 1 + 2 n − n 2 n 3 − 1 2 n 2 + 8 n + 9 3 = ( − n + 1 0 ) + n 2 − 2 n − 1 1 n + 1 7
Since p and n are both integers, the remainder r , n 2 − 2 n − 1 1 n + 1 7 must be integer as well.
The most obvious one is n = − 1 7 , yielding a remainder of 0 .
Then for such remainder to be an integer, the numerator ∣ n + 1 7 ∣ must be greater than or equal to the denominator ∣ n 2 − 2 n − 1 1 ∣ :
∣ n + 1 7 ∣ ≥ ∣ n 2 − 2 n − 1 1 ∣
For n < − 1 7 , ∣ n + 1 7 ∣ = − n − 1 7 . On the other hand, ∣ n 2 − 2 n − 1 1 ∣ = ∣ ( n − 1 ) 2 − 1 2 ∣ ; the absolute value is positive for n < − 1 2 or n > 1 2 .
Thus, for n < − 1 7 , the equation obtained would be: − n − 1 7 ≥ n 2 − 2 n − 1 1 . Then 0 ≥ n 2 − n + 6 = ( n − 0 . 5 ) 2 + 5 . 7 5 , with no real answer. Thus, there is no answer for n < − 1 7 .
Hence, the possible values lie in n > − 1 7 , for, first, ∣ n 2 − 2 n − 1 1 ∣ = n 2 − 2 n − 1 1 for n < − 1 2 or n > 1 2 or, second, ∣ n 2 − 2 n − 1 1 ∣ = − n 2 + 2 n + 1 1 for − 1 2 < n < 1 2 .
For the latter scenario, we can similarly solve the equation n + 1 7 ≥ − n 2 + 2 n + 1 1 : n 2 − n + 6 > 0 , which is true for all n . Yet, the applicable range is − 1 2 < n < 1 2 , or more specifically − 3 ≤ n ≤ 3 .
Then for the former scenario, n + 1 7 ≥ n 2 − 2 n − 1 1 . Then 0 ≥ n 2 − 3 n − 2 8 = ( n − 7 ) ( n + 4 ) . The applicable range is − 4 ≤ n ≤ 7 and n < − 1 2 or n > 1 2 . Hence, the overall applicable range is − 4 ≤ n ≤ − 3 or 3 ≤ n ≤ 7 .
Combining all possible ranges, we will obtain − 4 ≤ n ≤ 7 or n = − 1 7 . By trial and error, we can calculate the remainders r :
For n = − 1 7 , r = 0 .
For n = − 4 , r = 1 .
For n = − 3 , r = 2 7 .
For n = − 2 , r = − 5 .
For n = − 1 , r = − 2 .
For n = 0 , r = 1 1 − 1 7 .
For n = 1 , r = 2 − 3 .
For n = 2 , r = 1 1 − 1 9 .
For n = 3 , r = 2 − 5 .
For n = 4 , r = − 7 .
For n = 5 , r = 2 1 1 .
For n = 6 , r = 1 3 2 3 .
For n = 7 , r = 1 .
We can include the integer remainders to check which would satisfy a prime p :
For n = − 1 7 , r = 0 ; p = 2 7 .
For n = − 4 , r = 1 ; p = 1 5 .
For n = − 2 , r = − 5 ; p = 7 .
For n = − 1 , r = − 2 ; p = 9 .
For n = 4 , r = − 7 ; p = − 1 .
For n = 7 , r = 1 ; p = 4 .
Finally, p = 7 is the only solution. Thus, such sum is 7 .
I think you meant that the most obvious value of n is n = − 1 7 rather than n = 1 7 .
Oh, yes. My mistake. It's edited. Thank you.
Problem Loading...
Note Loading...
Set Loading...
It is not too hard to rewrite the expression on the LHS as
1 0 − n + n 2 − 2 n − 1 1 n + 1 7
For this to be a prime number it must certainly be an integer!
Now a necessary condition (not a sufficient one) for this to be an an integer is that the numerator of the fraction is greater than the denominator. Think of the numerator as a line and the denominator as a concave upwards parabola. They intersect when
n + 1 7 = n 2 − 2 n − 1 1 ⟹ n 2 − 3 n − 2 8 = 0 ⟹ ( n + 4 ) ( n − 7 ) = 0
The parabola lies below the line between n = − 4 and n = 7 and so we need to check the formula only for the 12 values of n satisfying − 4 ≤ n ≤ 7
This is easy to do using the TABLE function on a scientific calculator, and the only prime is 7 occurring when n = − 2
Alex Burgess points out that we should also test n = − 1 7 . Then we get 1 0 − − 1 7 = 2 7 = 3 × 9 so we are stll ok (whew!)