Let be a positive integer solution to the statement " is prime for some integer ". The sum of all such solutions would be ----
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.
x p − 1 = ( x − 1 ) ( x p − 1 + x p − 2 + ⋯ + x + 1 )
For x p − 1 to be prime, at least one of the two terms in the RHS should become either 0 or 1.
x p > 0 , ∀ x , p > 1 . Therefore, ( x p − 1 + x p − 2 + ⋯ + x + 1 ) > 1
( x − 1 ) = 0 → x = 1 . But, in this case x p − 1 = 1 p − 1 = 1 − 1 = 0 , which is not prime. Hence, x = 1
This leaves only one solution that x − 1 = 1 or x = 2