For integer , find the sum of all prime numbers which are of the form .
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.
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.
The given expression can be factored as ( N − 1 7 ) ( N 2 − 1 9 7 ) . There are then 4 possible options where this can yield a prime number:
(i) N − 1 7 = 1 ⟹ N = 1 8 , yielding 1 8 2 − 1 9 7 = 1 2 7 , which is indeed prime;
(ii) N − 1 7 = − 1 ⟹ N = 1 6 , yielding ( − 1 ) ( 1 6 2 − 1 9 7 ) = − 5 9 , which is not prime, (as defined);
(iii) N 2 − 1 9 7 = 1 ⟹ N 2 = 1 9 8 , for which N is not an integer;
(iv) N 2 − 1 9 7 = − 1 ⟹ N 2 = 1 9 6 ⟹ N = ± 1 4 :
----- (a) N = 1 4 yields ( 1 4 − 1 7 ) ( 1 4 2 − 1 9 7 ) = ( − 3 ) ( − 1 ) = 3 , which is prime;
----- (b) N = − 1 4 yields ( − 1 4 − 1 7 ) ( ( − 1 4 ) 2 − 1 9 7 ) = ( − 3 1 ) ( − 1 ) = 3 1 , which is also prime.
Thus there are three prime numbers that can be expressed in the given form, their sum being
1 2 7 + 3 + 3 1 = 1 6 1 .