Find the sum of all integers n such that
n 3 − 8 n 2 + 2 0 n − 1 3
is a prime number.
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.
Did it the same way, nice solution!
did a little silly mistake.u are a genius sir
Did it the same way except that I forget to check the condition for n<=0 :P
Did the same each and every step
The polynomial can be written as a product of two integers: P ( n ) = ( n − 1 ) ( n 2 − 7 n + 1 3 ) . For this product to be a prime number, we need one of the factors to be either + 1 or − 1 , otherwise the product will be composite or 0.
Possibilities for n − 1 = ± 1 are: n = 0 or n = 2 .
Possibilities for n 2 − 7 n + 1 3 = 1 are n = 2 7 ± 7 2 − 4 × 1 × 1 2 so that n = 3 or n = 4 .
For n 2 − 7 n + 1 3 = − 1 there are no solutions.
Checking each of these possibilities for primality:
The n's for which P(n) is a prime add up as 2 + 3 + 4 = 9
Problem Loading...
Note Loading...
Set Loading...
First note that for n ≤ 0 we have that n 3 − 8 n 2 + 2 0 n − 1 3 ≤ 0 , and hence cannot be prime. Thus we are only concerned with n ∈ N .
Now upon observation we note that n = 1 is a zero of the given expression, so factoring out ( n − 1 ) gives us that
n 3 − 8 n 2 + 2 0 n − 1 3 = ( n − 1 ) ( n 2 − 7 n + 1 3 ) . So for this to be prime, we must have that either
(i) n − 1 = 1 ⟹ n = 2 , which gives us the prime 3 , or
(ii) n 2 − 7 n + 1 3 = 1 ⟹ n 2 − 7 n + 1 2 = ( n − 3 ) ( n − 4 ) = 0 ⟹ n = 3 , 4 , giving us primes 2 , 3 .
Thus the only values of n that make the given expression prime are 2 , 3 , 4 , which sum to 9 .