Calvin was given 2016 line segments with lengths of respectively and he had to pick three random lines to form a triangle. Determine the possible number of triangles Calvin could form.
Details and assumptions
All the lengths are in the same system of units.
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.
Okay this was something very tedious for me and I'm expecting a better solution.
I opted for total cases - illegal cases.
Total cases= ( 2 0 1 6 3 )
Illegal cases :-
For smallest side= 1 :- 2 0 1 4 + 2 0 1 3 + . . . + 1 = S ( 2 0 1 4 )
For smallest side = 2 :- 2 0 1 2 + 2 0 1 1 + . . . + 1 = S ( 2 0 1 2 )
And so on till:-
For smallest side = 1 0 0 7 :- 2 + 1 = S ( 2 )
Thus total number of illegal cases = S ( 2 ) + S ( 4 ) + . . . S ( 2 0 1 4 ) = ∑ x = 1 1 0 0 7 ( 1 0 0 8 − x ) ( 4 x − 1 )
This easily computes to 6 8 2 2 8 6 8 0 8
Hence, total number of legal triangles = ( 2 0 1 6 3 ) − 6 8 2 2 8 6 8 0 8 = 6 8 1 2 7 1 7 5 2