The fifth power

Number Theory Level pending

Let P ( n ) = n 5 n P(n)=n^5-n be a function defined for positive integers n n . Which of the following statements are true for all n n .

[1] P ( n ) m o d ( n + 1 ) = 0 P(n) \mod (n+1) = 0

[2] P ( n ) m o d 10 = 0 P(n) \mod 10 = 0

[3] P ( n ) m o d ( n 2 + 1 ) = 0 P(n) \mod (n^2+1) = 0

[1] and [2], not [3] [1] and [3], not [2] [1] only [1], [2] and [3] None of the other options

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

First of all, n 5 n = n ( n 1 ) ( n + 1 ) ( n 2 + 1 ) n^5-n=n(n-1)(n+1)(n^2+1) .

Hence, statements [1] and [3] are true.

Further, it can also be verified that n 5 m o d 10 = n m o d 10 n^5 \mod 10 = n \mod 10 for all positive integers n n . Thus, statement [2] is also true.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...