Let (a,b,c) be a Pythagorean triple, i.e., a triplet of positive integers with a2+b2=c2.
a) Prove that (c/a+c/b)2>8.
b) Prove that there does not exist any integer n for which we can find a Pythagorean triple (a,b,c) satisfying (c/a+c/b)2=n.
## a) Solution 1
Let (a,b,c) be a Pythagorean triple. View a,b as lengths of the legs of a right angled triangle with hypotenuse of length c; let θ be the angle determined by the sides with lengths a and c. Then
(ac+bc)2=(cosθ1+sinθ1)2=(sinθcosθ)2sin2θ+cos2θ+2sinθcosθ=4(sin22θ1+sin2θ)=sin22θ4+sin2θ4
Note that because 0<sin2θ≤1, we have sin22θ4+sin2θ4>8. Therefore, (ac+bc)2>8.
Want a route through all this instead of an archive?
The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.