24i dont think this can be solved...[2]
If n line segments of length 1,2,3,4....,n units are given,Calculate number of triangles that can be formed using them
( I saw a ques in which four line segments were given..and answer was caclulated using triangle inequality...but that process looked very lengthy for larger no. of lines....so looking for some good short method)
-
UP 0 DOWN 0 0 6
6 Answers
24sir can u plz show how to begin it....i can try to carry it forward..
62take the triangle with the largest side n
then you will have 3 cases..
all three sides of side n
2 sides of side n
and exactly one side of side n
Then you have tn-1 (All triangles formed by sides of lenght 1, 2, .... , n-1)
(Does it help you by any way?)
1it gives a series by induction
series is
1+2+4+6+9+12+16+20+25+30+36+....................n terms
sum this upto n terms u get number of triangles which can be formed