Let be three distinct positive integers such that , , and are all perfect squares. Find the minimum value of .
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.
As in the inspiration question, we are looking for the smallest possible value of d 2 , where 0 < a < b < c < d are integers and a 2 + b 2 + c 2 = 2 d 2 .
If d is even, then 2 d 2 is a multiple of 8 , and hence (since odd squares are congruent to 1 modulo 8 ), all of a , b , c are even. Thus we could divide each of a , b , c , d by 2 , obtaining another solution with a smaller fourth value. Thus, for the smallest possible value of d 2 , d will be odd. Since 0 < a < b < c < d , we deduce that d ≥ 5 .
If c < d 3 2 then a 2 + b 2 + c 2 < 2 d 2 , which is impossible. Thus we must have d > c > d 3 2 . There are a number of cases to consider:
On the other hand, 1 1 2 + 1 9 2 + 2 0 2 = 2 × 2 1 2 , and so the smallest value of x + y + z is 2 1 2 = 4 4 1 ,
In the above I am using without comment the fact that an integer cannot be written as the sum of two nonzero squares if its prime factorisation contains a prime factor that is congruent to 3 modulo 4 and which has odd index, together with some basic ideas of factorisation in the Gaussian integers Z [ i ]