Find all right angled triangles with integer side lengths, ( x , y , z ) such that the area of the triangle is equal to its perimeter.
Count each triangle once, for example a ( 3 , 4 , 5 ) is the same triangle as ( 4 , 3 , 5 ) .
Enter your answer as i = 1 ∑ n ( x i + y i + z i )
This is an interesting problem originally suggested by Professor Paul Zeitz (as far as I know).
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 sides of the right triangle be x , y and x 2 + y 2 . Then the perimeter of the triangle is x + y + x 2 + y 2 and its area is 2 x y .
Equating two expressions gives, x + y + x 2 + y 2 = 2 x y ⟹ x 2 + y 2 = ( 2 x y − x − y ) 2 which on simplification yields x + y = 4 x y + 2 It follows that 4 divides x y , which leads to two cases, either 2 divides both x and y , or 4 divides x or y .
Assume 2 divides both x and y . Let x = 2 a and y = 2 b . We get 2 a + 2 b = a b + 2 ⟹ 2 ∣ a b . Therefore 2 divides a or b , so either x or y is divisible by 4. Thus both our cases are the same!
Suppose that y = 4 c for some positive integer c . Substituting this in our equation gives, x + 4 c = x c + 2 . Rearrange the equation as ( x − 4 ) + 2 = c ( x − 4 ) ⟹ ( x − 4 ) ∣ 2 .
Thus the only solutions are x = 5 and x = 6 which leads to y = 1 2 and y = 8 respectively. ( x , y , z ) = ( 5 , 1 2 , 1 3 ) , ( 6 , 8 , 1 0 )
Answer: ( 6 + 8 + 1 0 ) + ( 5 + 1 2 + 1 3 ) = 5 4
From the given conditions of the problem, we get x=4(2-y)/(4-y). y can not be equal to 2 or 4. y<2 has no solution. y>4 has only 2 solutions. They are (i) y=5, x=12, z=13 and (ii) y=6, x=8, z=10. Therefore the required sum is (5+12+13)+(6+8+10)=54
Problem Loading...
Note Loading...
Set Loading...
A slightly different approach to the other solutions is to start from Euclid's formula for Pythagorean triples.
Any integer sided right-angled triangle has sides that can be written as t ( u 2 − v 2 ) , 2 t u v and t ( u 2 + v 2 ) for some integers u > v > 0 and t > 0 .
These give an area of t 2 u v ( u 2 − v 2 ) and perimeter 2 t u ( u + v ) . Equating these, we find
t v ( u − v ) = 2
It's pretty quick to check cases; if t = 2 then v = u − v = 1 so u = 2 , v = 1 and the sides are ( 6 , 8 , 1 0 ) .
If v = 2 we need t = u − v = 1 , so u = 3 ; this gives the sides ( 5 , 1 2 , 1 3 )
If u − v = 2 , t = v = 1 and u = 3 ; this again gives sides ( 8 , 6 , 1 0 ) (which we've already had).
So the only two triangles are ( 6 , 8 , 1 0 ) and ( 5 , 1 2 , 1 3 0 , giving the answer 5 4 .
Incidentally, shapes with the property of having (numerically) equal area and perimeter are known as " equable ", and seem to have been around for quite a while (according to the linked article, an extension of this problem to general integer sided triangles was discussed in 1858 and solved in 1904).