If , , and are nonzero integers satisfying
compute the smallest possible 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.
We assume p + q + r is nonnegative, otherwise just negate p , q and r .
Firstly, by parity, if p 2 + q 2 = r 2 , then p + q + r cannot be odd.
Secondly, if p + q + r = 0 , then p + q = − r . Substituting this into the first equation, we get p 2 + q 2 = ( p + q ) 2 , so 2 p q = 0 . Therefore, either p = 0 or q = 0 , which is impossible since p and q are non-zero. Therefore, p + q + r ≥ 2 .
We can construct 3 numbers that satisfy this: p = 3 , q = 4 , r = − 5 , which is inspired by using the Pythagorean triplet 3 2 + 4 2 = 5 2 . Therefore, the minimum value of ( p + q + r ) 2 = 4 .