Let be a triangle with integer side lengths and the property that . What is the least possible perimeter of such a triangle?
, 2024
Pick one
Solution
Let , , and be the lengths of the sides opposite vertices , , and , respectively. Note that . Applying the Law of Sines in , together with the identities and
give
Thus and
which simplifies to .
In looking for the triangle with least perimeter, it can be assumed that and are relatively prime, because otherwise a smaller triangle can be obtained by shrinking by a factor of . Then and are relatively prime as well. Because , the numbers and must be squares, say and , where and . This gives , , and .
If , then and , a violation of the Triangle Inequality. If , then the least perimeter will occur when , with , , and . Greater values of lead to greater perimeters. The requested minimum perimeter is .
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.