line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. What is the minimum value of such that you are assured to make a triangle with any 3 line segments without violating the triangle inequality?
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.
Consider any 3 arbitrary lines in the domain of 1 − 1 0 . If we consider the worst case such that these lines violate the triangle inequality, then we have to look upon for next set of 3 lines. Now, again if they violate the triangle inequality, we may arrange the six line segments in the groups of two. Now we may take any arbitrary line it will sure that it will not violate the triangle inequality in any one of the groups. So on adding we get, minimum number of line segments = 7