The right triangle with the smallest possible sum of its area and its perimeter, where both area and perimeter are integers, has a hypotenuse of q p , where p and q are relatively prime positive integers. Find p + q .
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.
Let the area of the triangle be A and its perimeter P .
Over all right-angled triangles, the ratio A P 2 is minimised by the right-angled isosceles triangle, in which it is 2 ( 2 + 2 ) 2 ≈ 2 3 . 3 1 . (This is a fairly intuitive result but also a nice thing to prove as a side-problem.)
We're interested in minimising A + P for positive integers A , P subject to A P 2 ≥ 2 ( 2 + 2 ) 2 ; the pair we're after is A = 1 , P = 5 .
To find the triangle with these properties, say the triangle has legs x , y and hypotenuse z , so x 2 + y 2 = z 2 . Also A = 2 x y and P = x + y + z .
We have z = P − x − y and y = x 2 A . Putting these together, x 2 + x 2 4 A 2 x 2 + x 2 4 A 2 0 2 P x 2 − ( 4 A + P 2 ) x + 4 A P = ( P − x − x 2 A ) 2 = P 2 + x 2 + x 2 4 A 2 − 2 P x − x 4 A P + 4 A = P 2 − 2 P x − x 4 A P + 4 A = 0
We can substitute in and solve here, but it's neater to note that the two roots of this quadratic are just the two legs of the triangle; so - by Vieta - x + y = 2 P 4 A + P 2 and z = P − x − y so that z = 2 P P 2 − 4 A
Plugging in A = 1 , P = 5 we get z = 1 0 2 1 so the answer is 3 1 .
Note that in this case the legs x , y are not rational; in fact x , y = 2 0 2 9 ± 4 1 .
What is this triangle, by the way?! Does it have any other nice properties? (One of its angles is very close to 1 radian, but not close enough to count as "nice"!)
Log in to reply
I'm not sure. I had wondered what right triangle had the smallest possible area and perimeter sum where both were integers, even if the sides weren't integers, and I came up with this.
Log in to reply
Somehow it feels unusual to find an unfamiliar triangle, even though - obviously - almost all of them are.
I spent quite a while down a rabbit-hole of x = 2 u v , y = u 2 − v 2 , z = u 2 + v 2 with this one - I wonder if others did too?
Log in to reply
@Chris Lewis – Yeah, I also spent a lot of time with Pythagorean triples. I thought all the sides must be rational. After some fruitless calculations, I posited my assumption was wrong.
I did it pretty much the same way, except I found A P 2 ≥ 2 ( 2 + 2 ) 2 by setting the discriminant of 2 P x 2 − ( 4 A + P 2 ) x + 4 A P greater or equal to 0 .
Log in to reply
Nice. I wound up discovering several impossible triangles before realising I needed this condition.
Problem Loading...
Note Loading...
Set Loading...
Let A , P be the area and the perimeter of the right triangle △ A B C and a , b , c its hypotenuse and legs.
Then A = 2 b c ⇒ c = b 2 A , A ≥ 1 .
P = b + c + a = b + b 2 A + b 2 + b 2 4 A 2
The sum we want to minimise is S = A + P = A + b + b 2 A + b 2 + b 2 4 A 2 .
For any fixed value of the area A , the sum becomes a function of b and S ′ ( b ) = b 2 b 4 + 4 A 2 ( b 2 − 2 A ) [ b 4 + 4 A 2 + b 2 + 2 A ] .
Thus, S ′ ( b ) = 0 ⇔ b 2 − 2 A = 0 ⇔ b > 0 b = 2 A .
This means that, for any constant value of A , the sum is minimised when S ′ ( b ) = 0 ⇔ b 2 − 2 A = 0 ⇔ b > 0 b = 2 A .
The minimum value is S ( 2 A ) = … = A + 2 ( 2 + 1 ) A .
In terms of A , the function y = A + 2 ( 2 + 1 ) A is increasing, thus, for A ≥ 1 , it gives its minimum when A = 1 .
Then S becomes S min = S ( 1 ) = 2 2 + 3 ≈ 5 . 8 2 8 .
We conclude that the minimum possible integer value of S can be 6.
In this case, we have: S = 6 ⇔ A = 1 1 + b + b 2 + b 2 + b 2 4 = 6 ⇔ b 4 + 4 = − b 2 + 5 b + 2 0 ⇔ … ⇔ b = 2 0 2 9 ± 4 1
With this value, we get:
c = b 2 = 2 0 2 9 ∓ 4 1 and hypotenuse b 2 + b 2 4 = 1 0 2 1 .
Summing up the elements of our triangle:
For the answer, p = 2 1 , q = 1 0 , so p + q = 3 1 .