Given, n 4 + 4 . Find the sum of the integer values of n for which the given expression gives a prime number.
If no such values exist answer 666.
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.
n 4 + 4
n 4 + 4 n 2 + 4 - 4 n 2
[( n 2 + 2)^{2}]- 4 n 2
( n 2 +2n+2)( n 2 -2n+2)
.•. for +ve integers, for n 4 + 4 to be prime,
( n 2 -2n+2) = 1
.•. n 2 -2n+1 = 0
.•. ( n − 1 ) 2 = 0
.•. n-1 = 0
.•. n = 1
Similarly, for -ve integers,
( n 2 +2n+2) = 1
( n + 1 ) 2 = 0
n = − 1
.•. 1 + (-1) = 0
Hence, 0
Sorry did not see your solution. You posted it while I was typing mine. Almost same time.
So basically the sum of all the solutions for it is 0 because for each positive one there is the respective negative solution. w0w ⅈ ℂ∀ℵ'+ ℏ∀ℝ∂Lɣ в∑Lⅈ∑∠∑ ⅈ &0+ +ℏ∀+ wℝ0ℵ&. wℏɣ ⅈ∫ ⅈ+ L∑∠∑L +ℏℝ∑∑ +ℏ0∪&ℏ?
Problem Loading...
Note Loading...
Set Loading...
By the Sophie Germain identity, n 4 + 4 = ( n 2 + 2 n + 2 ) ( n 2 − 2 n + 2 ) . For it to be a prime number, one of the two terms must be 1. So either n 2 + 2 n + 2 = 1 or n 2 − 2 n + 2 = 1 . The former case is ( n + 1 ) 2 = 0 so n = − 1 and the latter case is ( n − 1 ) 2 = 0 so n = 1 . Therefore, sum of all integer values of n is 0 .