Prime time for a number theory question

Let p be a prime number, and let n be a positive integer. How many possible solutions are there to: n 3 = p + 1 n^{3} = p + 1 ?


The answer is 1.

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

Samuel Sturge
Jul 5, 2019
  • n 3 = p + 1 n^3 = p + 1
  • n 3 1 = p n^3 - 1 = p
  • ( n 2 + n + 1 ) ( n 1 ) = p (n^2 + n + 1)(n - 1) = p
  • Since p has 2 factors, 1 and p, either n 2 + n + 1 = 1 n^2 + n + 1 = 1 or n 1 = 1 n - 1 = 1
  • If n 2 + n + 1 = 1 n^2 + n + 1 = 1 , then n ( n + 1 ) = 0 n(n + 1) = 0 , giving (\n = 0,-1. )
  • Neither of these are positive integers, so we are left with n 1 = 1 n - 1 = 1 , which only has 1 solution : 2 2

Nice solution but be careful - you're missing one key point! What happens if you try the same approach to find the number of solutions to n 11 = p + 1 n^{11}=p+1 ? (Same conditions - n n a positive integer and p p prime.)

Chris Lewis - 1 year, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...