If a , b , c , and d are distinct pairwise co-prime positive integers such that a 2 + b 2 = c 2 + d 2 , find the lowest possible value of a + b + c + d .
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.
*the pairwise condition is needed - if the requirement is just that g cd ( a , b , c , d ) = 1 then the set ( a , b , c , d ) = ( 1 , 8 , 4 , 7 ) works, with total 2 0 .
Great solution! Completely different than my approach, but I like yours better. (I'll post my solution later.)
Log in to reply
Thanks! Very interested to see a different solution, as ever. Mine would not have worked very well if the first valid set had totalled, say, 1 0 0 0 ...
(To be honest, my actual solution was to just code it and search, but I'm always keen to try and find a way without doing that. I was really surprised that eliminating the small prime factors left a set that worked straight away.)
Log in to reply
I posted my solution. Basically I rearranged the equation to be a difference of squares and factored it, and then used some clues and then trial and error to arrive at the correct answer.
I did this the same way, but at first forgot about 1 .
Taking 7 as the smallest prime, and looking at QRs (mod 7) (which are 0,1,2,4), we note that we must have 0 + 2 = 1 + 1 or 0 + 4 = 2 + 2
1 : 1 , , 1 1 : 2 , , 1 3 : 1 , , 1 7 : 2 , , 1 9 : 4 First possibility is 7 2 + 1 1 2 = 1 2 + 1 3 2 . Total is 32. Second possibility is 7 2 + 1 9 2 = 1 1 2 + 1 7 2 . Total is 54.
With the smallest prime being 1 1 , QR of (1,11,13,17) (mod 11) are (1,0,4,3). And 1 1 2 + 1 3 2 = 1 2 + 1 7 2 . Total is 42.
I forgot that they had to be coprime and just put 7,24,15,25 that where the first ones y got in my mind
If one of the numbers is even, then the other numbers (as distinct pairwise co-prime integers) must be odd, but then the sum of squares with the even number is odd and the sum of the squares without the even number is even. Therefore, none of the numbers can be even, so all of the numbers must be odd.
a 2 + b 2 = c 2 + d 2 can be rearranged to a 2 − c 2 = d 2 − b 2 . Since the square of any odd number is 1 ( m o d 8 ) , a 2 − c 2 (and d 2 − b 2 ) is divisible by 8 . a 2 − c 2 = d 2 − b 2 can further be rearranged to ( a − c ) ( a + c ) = ( d − b ) ( d + b ) , and since all the numbers are odd, each factor a − c , a + c , d − b , and d + b must be even.
Therefore, our search is narrowed down to testing multiples of 8 that can be written as a product of two even numbers in at least two different ways. For example, testing 2 4 we can have 2 ⋅ 1 2 and 4 ⋅ 6 , for a = 7 , c = 5 , d = 5 and b = 1 , but unfortunately in this case c and d are not distinct. The table below summarizes the first few possibilities.
The first number that gives us a correct result is 4 8 = 2 ⋅ 2 4 = 6 ⋅ 8 , for a = 1 3 , c = 1 1 , d = 7 , and b = 1 , so that 1 3 2 + 1 2 = 1 1 2 + 7 2 = 1 7 0 , which results in the lowest value for a + b + c + d of 1 3 + 1 + 1 1 + 7 = 3 2 .
Very nice! I tried the differences of two squares idea but didn't get anywhere with it. Nice to see it can lead to a systematic approach. I wonder if there's any way that doesn't involve case analysis/trial and error. It seems there might be a way to construct quadruples that satisfy the equation in a way similar to Euclid's method for constructing primitive Pythagorean triples, but I don't quite know how.
Chris Lewis' solution is correct.
Union [ a + b + c + d /. Solve [ ( a ∣ b ∣ c ∣ d ) ∈ Z > 0 ∧ g cd ( a , b ) = 1 ∧ g cd ( a , c ) = 1 ∧ g cd ( a , d ) = 1 ∧ g cd ( b , c ) = 1 ∧ g cd ( b , d ) = 1 ∧ g cd ( c , d ) = 1 ∧ a 2 + b 2 = c 2 + d 2 ∧ a < 1 5 ∧ b < 1 5 ∧ c < 1 5 ∧ d < 1 5 ∧ a = b ∧ a = c ∧ a = d ∧ b = c ∧ b = d ∧ c = d ] ] [ [ 1 ] ] ⇒ 3 2
Solutions with value less than or equal to 24:
⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ 1 1 1 1 1 1 7 7 7 7 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 3 1 3 1 3 1 3 1 3 1 7 1 7 1 7 1 7 1 7 1 7 1 9 1 9 1 9 1 9 1 9 1 9 2 3 2 3 2 3 2 3 1 3 1 3 1 7 1 7 2 3 2 3 1 1 1 1 1 9 1 9 7 7 1 3 1 3 1 7 1 7 2 3 2 3 1 1 1 1 1 1 1 9 1 9 1 1 1 1 1 1 1 9 1 9 7 7 1 3 1 3 1 7 1 7 1 1 1 1 1 1 7 1 1 1 1 1 3 1 3 1 9 1 1 3 1 1 1 7 1 1 3 1 1 7 7 1 9 1 7 1 9 7 1 1 1 1 7 1 2 3 1 1 1 3 7 1 9 1 1 2 3 1 1 1 7 1 2 3 1 1 2 3 1 3 1 9 1 7 1 9 1 1 7 1 3 1 1 1 9 1 3 1 3 1 1 7 1 1 1 3 1 1 7 1 1 9 7 1 9 1 7 1 1 7 1 7 1 2 3 1 1 3 1 1 1 9 7 2 3 1 1 1 7 1 1 2 3 1 2 3 1 1 1 9 1 3 1 9 1 7 ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞
Problem Loading...
Note Loading...
Set Loading...
Some observations: since the integers a , b , c , d are pairwise* coprime, at most one of them is even; so none of them is.
Similarly, assume exactly one of the integers is a multiple of 3 . Then the other three are not multiples of 3 , and reducing modulo 3 shows that we again reach a contradiction. So there are no multiples of 3 .
We can even do this modulo 5 : assume that a is a multiple of 5 . Then b 2 ≡ c 2 + d 2 ( m o d 5 ) . But the quadratic residues modulo 5 are 0 , 1 and 4 , and none of b , c , d can be a multiple of 5 ; so our initial assumption was once again wrong, and there are no multiples of 5 among the four integers.
Multiples of 2 , 3 and 5 aren't allowed. That means the integers must belong to the set { 1 , 7 , 1 1 , 1 3 , 1 7 , … } , and we can stop searching here; it turns out the smallest possible set ( a , b , c , d ) = ( 1 , 1 3 , 7 , 1 1 ) works, with total 3 2 .
Incidentally, the next smallest set ( 1 , 1 7 , 1 1 , 1 3 ) also satisfies the equation.