Find the number of solutions for a , b , c , and d that satisfy the equations:
a 2 + b 2 + c 2 + d 2 = 2 b 2 + c 2 − 2 c d = b 2 + 2 c 2 − 2 a b
where all four variables are positive integers and the g cd ( a , b , c , d ) = 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.
will it also not work if a b c d were not positive integers
Log in to reply
I believe there would still be zero solutions, but my solution would break down since my geometrical representation relies on a, b, c, and d to be positive.
The equations can be rewritten as a 2 + ( c + d ) 2 = b 2 + c 2 = ( a + b ) 2 + d 2 If we suppose that the HCF of b and c is u , so that b = u B , c = u C for coprime positive integers B , C , then u C ( c + 2 d ) = ( c + d ) 2 − d 2 = ( a + b ) 2 − a 2 = ( 2 a + b ) u B so that c + 2 d = v B , 2 a + b = v C for some positive integer v . But then v 2 ( B 2 + C 2 ) = b 2 + c 2 = a 2 + ( c + d ) 2 = ( 2 1 ( v C − u B ) ) 2 + ( 2 1 ( v B + u C ) ) 2 = 4 1 ( u 2 + v 2 ) ( B 2 + C 2 ) and hence v 2 = 4 1 ( u 2 + v 2 ) , and hence u 2 = 3 v 2 . Thus, if there were any positive integer solutions of this equation, then 3 would be rational.
Thus there are no solutions.
Take twice the first equation and subtract out the second and third from it. This gives 2 a 2 + 2 b 2 + 2 c 2 + 2 d 2 − ( 2 b 2 + c 2 − 2 c d ) − ( b 2 + 2 c 2 − 2 a b ) = 0 2 a 2 + 2 d 2 − b 2 − c 2 + 2 a b + 2 c d = 0 2 a 2 + 2 d 2 = b 2 + c 2 − 2 a b − 2 c d 3 a 2 + 3 d 2 = a 2 + b 2 + c 2 + d 2 − 2 a b − 2 c d = ( a − b ) 2 + ( c − d ) 2 Now squares are only 0 or 1 mod 3 and since the LHS is divisible by 3, a − b ≡ 0 ( m o d 3 ) c − d ≡ 0 ( m o d 3 ) However due to the nature of squares having even prime exponents, this would actually make each of the squares on the RHS be divisible by 9! This would force a 2 ≡ 0 ( m o d 3 ) d 2 ≡ 0 ( m o d 3 ) a ≡ 0 ( m o d 3 ) d ≡ 0 ( m o d 3 ) b ≡ a ≡ 0 ( m o d 3 ) c ≡ d ≡ 0 ( m o d 3 ) so all of the variables are divisible by 3, violating the gcd restriction. Thus there are no solutions
Very nice!
a²+b²+c²+d²=2b²+c²-2cd => b²-a²=2cd+d²...(i) Comparing 1st and 3rd part of given eqn, we get, b²+2ab=d²-c²...(ii) By (i)-(ii) we get, -a²-2ab=c²+2cd, which is impossible if a,b,c,d are positive integers
When I compare the 1st and 3rd part of the given equation, the b 2 crosses out...
O yes, looks like I made a mistake, it will be a²+2ab=c²+2cd, looks like my solution is wrong :(
The facts that A > B and C > D does not make it impossible for A − C to equal B − D . For example, consider 7 > 5 and 5 > 3 , but 7 − 5 = 5 − 3 .
Problem Loading...
Note Loading...
Set Loading...
a 2 + b 2 + c 2 + d 2 = 2 b 2 + c 2 − 2 c d can be rearranged to:
a 2 + ( c + d ) 2 = b 2 + c 2
and a 2 + b 2 + c 2 + d 2 = b 2 + 2 c 2 − 2 a b can be rearranged to:
( a + b ) 2 + d 2 = b 2 + c 2
Now consider the following diagram of a rectangle with sides a + b and c + d :
According to the equations above, by Pythagorean's Theorem each of the three right triangles' hypotenuses are equal to each other, so the center triangle must be an equilateral triangle. Let the side of that equilateral triangle be s .
By Pythagorean's Theorem b 2 + c 2 = s 2 , so if a , b , c , and d are positive integers, then s 2 must be an integer, too, and by the area of an equilateral triangle A = 4 3 s 2 the area A must be irrational.
However, the area of the equilateral triangle is the area of the rectangle minus the sum of the three right triangles, or A = ( a + b ) ( c + d ) − ( 2 1 ( a + b ) d + 2 1 b c + 2 1 a ( c + d ) ) = 2 1 ( a c + b c + b d ) , and if a , b , c , and d are positive integers, then the area A must be rational.
The area can't be rational and irrational at the same time, so it can't be that a , b , c , and d are all positive integers.
Therefore, there are zero solutions to the given equations with the given conditions.