If a rod of length is broken into three parts with integer lengths to form isosceles triangles. What is the number of these triangles?
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.
The length of the base side must be odd call it B , so 2 0 1 9 − B is even and then the legs can be equal .
But B can get values up to 1 0 0 9 , because the sum of each two sides in triangle must be greater than the last side .
So B can be 1 , 3 , . . . , 1 0 0 7 , 1 0 0 9 .. we have 5 0 5 choices .
The sides of the triangles will be :
( 1 , 1 0 0 9 , 1 0 0 9 ) − ( 3 , 1 0 0 8 , 1 0 0 8 ) − . . . − ( 1 0 0 7 , 5 0 6 , 5 0 6 ) − ( 1 0 0 9 , 5 0 5 , 5 0 5 )