x 2 + x y + y 2 = z 2
Let x , y , and z be prime numbers satisfying the equation above. What is the largest possible product x y z ?
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.
I got to the factors of xy but then I gave up as it was time to sleep :(
This was very helpful -- thank you!
Relevant wiki: Quadratic Diophantine Equations - Solve by Factoring
Let f ( x , y , z ) : x 2 + x y + y 2 = z 2 .
Then x 2 + x y + ( y 2 − z 2 ) = 0
The quadratic residue must then be perfect square: y 2 − 4 ( y 2 − z 2 ) = n 2 for some integer n .
Thus, 4 z 2 − 3 y 2 = n 2 .
4 z 2 − n 2 = 3 y 2
( 2 z − n ) ( 2 z + n ) = 3 y 2
Since we are looking for prime numbers x , y , z , there are only three possible factorization for 3 y 2 :
3 y 2 = 1 × 3 y 2
3 y 2 = y × 3 y
3 y 2 = 3 × y 2
For the first scenario, if 3 y 2 = 1 × 3 y 2 , then 2 z + n = 3 y 2 and 2 z − n = 1 .
Then n = 2 z − 1 .
Hence, 4 z 2 − n 2 = 4 z 2 − ( 2 z − 1 ) 2 = 4 z − 1 = 2 n + 1 = 3 y 2
n = 2 3 y 2 − 1
Then x = 2 n − y = 4 3 y 2 − 2 y − 1 = 4 ( 3 y + 1 ) ( y − 1 ) .
Since x is prime, there are only three possible factorizations for the right terms:
I. 3 y + 1 = 4 x and y − 1 = 1 . In this case, y = 2 , but that will result in x = 4 7 , which is not a prime integer.
II. 3 y + 1 = x and y − 1 = 4 . In this case, y = 5 , but that will result in x = 1 6 , which is not a prime integer.
III. 3 y + 1 = 2 x and y − 1 = 2 . In this case, y = 3 , and that leads to x = 5 and z 2 = 5 2 + 5 × 3 + 3 2 = 4 9 . So z = 7 .
Thus, for this scenario, there is only one solution ( 5 , 3 , 7 ) for f ( x , y , z ) .
Second, for the next scenario, if 3 y 2 = y × 3 y , then 2 z + n = 3 y and 2 z − n = y .
Then 4 z = 4 y . z = y , and n = z = y . However, if n = y , x = 0 , so it is contradicted.
Finally, for the last scenario, if 3 y 2 = 3 × y 2 , then 2 z − n = 3 and 2 z + n = y 2 .
Then 2 n = y 2 − 3 . n = 2 y 2 − 3
Thus, x = 2 n − y = 4 y 2 − 2 y − 3 = 4 y 2 − 2 y + 1 − 4 = ( 2 y − 1 ) 2 − 1
Since x is prime, there is only one possible factorization: 1 × x = ( 2 y − 1 ) 2 − 1
Let m = 2 y − 1 for some integer m . Then m 2 − 1 = ( m + 1 ) ( m − 1 ) = 1 × x .
Thus, m + 1 = x , and m − 1 = 1 . Hence, m = 2 ; x = 3 ; and y = 5 . And z = 7 as in the first scenario.
As a result, by checking all possibilities, ( 3 , 5 , 7 ) and ( 5 , 3 , 7 ) the only optimal solutions for f ( x , y , z ) . Thus, x y z = 1 0 5 .
Long solution very bad
How is a long solution very bad Rupayan
Problem Loading...
Note Loading...
Set Loading...
Rewrite as ( x + y ) 2 − x y = z 2 , or ( x + y ) 2 − z 2 = x y . This factors: ( x + y − z ) ( x + y + z ) = x y . Because x and y are prime, x y has only the following factors: 1 , x , y , x y .
The factor x + y + z is strictly bigger than x and y , so it must be x y . Then x + y − z has to be 1 . Adding these equations gives 2 ( x + y ) = x y + 1 , which simplifies in the usual way to ( x − 2 ) ( y − 2 ) = 3 . The only solutions in prime numbers (indeed, positive integers) x , y are 3 , 5 and 5 , 3 , which leads to z = 7 . So the maximum (indeed, the only) product is x y z = 1 0 5 .