Find all integer solutions to the equation y 2 = x 3 − p 3 , where p is a prime number, y = 0 , 3 ∤ y , and p ∤ y . Enter your answer as ∑ ( x + p ) .
Note: Actually, you are going to find integer points on a family of Mordell curves. A Mordell curve is an elliptic curve of the form y 2 = x 3 + k , where k is a fixed non-zero integer.
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.
Really nice solution for a very good problem
Log in to reply
Thanks Shaivansh :) Glad you liked the problem.
Working in the Euclidean domain Z [ ω ] we are trying to solve y 2 = ( x − p ) ( x − ω p ) ( x − ω 2 p ) x , y ∈ Z Since neither 3 nor p divides y , no element of Z [ ω ] with norm 3 or p can divide y . Any irreducible common factor of x − p and x − ω p would have to divide ( 1 − ω ) p and y ; this is not possible (since 1 − ω has norm 3 ). Similarly, x − p and x − ω 2 p cannot have a common factor. Nor can x − ω p and x − ω 2 p have a common factor. Thus the three numbers x − p , x − ω p , x − ω 2 p are pairwise coprime. Thus we can write x − p = u A 2 x − ω p = v B 2 x − ω 2 p = w C 2 where A , B , C ∈ Z [ ω ] and u , v , w are units in Z [ ω ] .Since the units in Z [ ω ] are either squares or negative squares, we can assume that u , v , w = ± 1 .
If A = m + n ω then A 2 = ( m 2 − n 2 ) + n ( 2 m − n ) ω . Since A 2 ∈ R we deduce that n ( 2 m − n ) = 0 , so either n = 0 and A 2 = m 2 or else n = 2 m and A 2 = − 3 m 2 . Since 3 does not divide y , we deduce that the first of these cases must be true, and so x − p = ± m 2 for some m ∈ N . Since ( x − p ω ) ( x − p ω 2 ) = x 2 + x p + p 2 is positive, we deduce that x − p = m 2 .
We now consider the fact that x − p ω = ε B 2 = ε ( b + c ω ) 2 = ε ( b 2 − c 2 + c ( 2 b − c ) ω ) where b , c are integers and ε = ± 1 , For definiteness, assume that c > 0 . Then we have x − p = m 2 x = ε ( b 2 − c 2 ) − p = ε c ( 2 b − c ) There are four cases to consider:
Thus the only solutions to this family of equations are x = 8 , y = ± 1 3 , p = 7 , making the answer ( 8 + 7 ) + ( 8 + 7 ) = 3 0 .
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: General Diophantine Equations - Problem Solving
We have y 2 = ( x − p ) ( x 2 + x p + p 2 ) . ( 1 ) Let d = g cd ( x − p , x 2 + x p + p 2 ) , then d ∣ x 2 + x p + p 2 − ( x − p ) 2 = 3 x p ⟹ d ∣ 3 x p Suppose that d > 1 . Then d cannot take 3 or p , because it leads to d ∣ x − p ∣ y and negates conditions of the problem. It follows that d ∣ x and d ∣ x − ( x − p ) = p , and again contradicts p ∤ y . Thus d = 1 and factors of the RHS of equation ( 1 ) are co-prime and consequently both of them are squares. Specially x 2 + x p + p 2 = n 2 . Δ x must be a perfect square, that is − 3 p 2 + 4 n 2 = k 2
If p = 2 , then ( 2 n − k ) ( 2 n + k ) = 1 2 . Thus, k = 2 l and ( n − l ) ( n + l ) = 3 . It gives n = 2 and x 2 + 2 x + 4 = 4 . But both x = 0 and x = − 2 contradict x > p .
If p = 3 , then ( 2 n − k ) ( 2 n + k ) = 2 7 . It gives n = 3 , 7 . For n = 3 we get x 3 + 3 x = 0 and no integer solution for y . For n = 7 we get x 3 + 3 x = 4 0 , which gives x = − 8 and x = 5 . Its clear that x = − 8 is unacceptable and for x = 5 , x − p = 2 is not a perfect square.
Henceforth p > 3 and ( 2 n − k ) ( 2 n + k ) = 3 p 2 Since divisors of 3 p 2 are 1 < 3 < p < 3 p < p 2 < 3 p 2 , then we have k = p , k = ( p 2 − 3 ) / 2 or k = ( 3 p 2 − 1 ) / 2 .
For k = p we get x − p = ( − k + p ) / 2 − p = − p , which is not a perfect square.
For k = ( p 2 − 3 ) / 2 , x − p becomes ( p 2 − 6 p − 3 ) / 4 . Thus p 2 − 6 p − 3 = m 2 and m 2 + 1 2 = ( p − 3 ) 2 is a perfect square, which is possible only when m = 2 . It gives p = 7 and the solutions ( p , x , y ) = ( 7 , 8 , ± 1 3 ) .
If k = ( 3 p 2 − 1 ) / 2 , then x − p = ( 3 p 2 − 6 p − 1 ) / 4 . Thus 3 p 2 − 6 p − 1 = m 2 and Δ p = 3 m 2 + 1 2 = a 2 . Therefore a = 3 b and m 2 + 4 = 3 b 2 . Since a perfect square is congruent to 0 , 1 mod 3 , then m 2 + 4 cannot be divisible by 3 .Thus there is no solution in this case.
Thus, with the given conditions, there are two integer points on the family of Mordell curves y 2 = x 3 − p 3 . They are ( p , x , y ) = ( 7 , 8 , ± 1 3 ) . So the answer is 3 0 .