x p 1 x^p-1

Number Theory Level pending

Let x x be a positive integer solution to the statement " x p 1 x^p-1 is prime for some integer p > 1 p>1 ". The sum of all such solutions would be ----


The answer is 2.

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.

1 solution

x p 1 = ( x 1 ) ( x p 1 + x p 2 + + x + 1 ) x^p-1 = \left(x-1\right)\left(x^{p-1}+x^{p-2}+\cdots+x+1\right)

For x p 1 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 x^p > 0, \forall x,p>1 . Therefore, ( x p 1 + x p 2 + + x + 1 ) > 1 \left(x^{p-1}+x^{p-2}+\cdots+x+1\right)>1

( x 1 ) = 0 x = 1 (x-1)=0 \rightarrow x=1 . But, in this case x p 1 = 1 p 1 = 1 1 = 0 x^p - 1 =1^p-1=1-1=0 , which is not prime. Hence, x 1 x \ne 1

This leaves only one solution that x 1 = 1 x-1=1 or x = 2 \boxed{x=2}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...