Prime equation

Number Theory Level pending

Find all the prime numbers p p such that p 2 p + 1 = n 3 p^2-p+1=n^3 where n n is a positive integer.

Give your answer asthe sum of all the values of p p .


The answer is 19.

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

Enrico Sangoi
Feb 27, 2016

we can write the equation as p ( p 1 ) = ( n 1 ) ( n 2 + n + 1 ) p(p-1)=(n-1)(n^2+n+1) .

if p n 1 p|n-1 and n 2 + n + 1 p 1 n^2+n+1|p-1 we have n 2 + n + 1 p 1 n 2 n^2+n+1\leq p-1\leq n-2 and this is impossible.

It must be p n 2 + n + 1 p|n^2+n+1 and n 1 p 1 n-1|p-1 . We call a = p 1 n 1 = n 2 + n + 1 p a=\frac{p-1}{n-1}=\frac{n^2+n+1}{p} . so we have p = a n a + 1 p=an-a+1 and a p = n 2 + n + 1 ap=n^2+n+1 . From this two equations it follows p ( a 2 n 2 ) = ( 3 a n 2 ) p(a^2-n-2)=(3a-n-2) so it must be a 3 a\leq 3 and we can easily check that for a=1,2 there is no solution and for a = 3 p = 19 , x = 7 a=3 \rightarrow p=19 , x=7

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...