Isosceles triangles from 2019

If a rod of length 2019 2019 is broken into three parts with integer lengths to form isosceles triangles. What is the number of these triangles?


The answer is 505.

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.

1 solution

The length of the base side must be odd call it B B , so 2019 B 2019-B is even and then the legs can be equal .

But B B can get values up to 1009 1009 , because the sum of each two sides in triangle must be greater than the last side .

So B B can be 1 , 3 , . . . , 1007 , 1009 1,3,...,1007,1009 .. we have 505 \boxed{505} choices .

The sides of the triangles will be :

( 1 , 1009 , 1009 ) ( 3 , 1008 , 1008 ) . . . ( 1007 , 506 , 506 ) ( 1009 , 505 , 505 ) (1,1009,1009)-(3,1008,1008)-...-(1007,506,506)-(1009,505,505)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...