I was cleaning up my attic recently and found a set of at least 14 sticks which a curious Italian gentleman sold me some years ago. Trying hard to figure out why I bought it from him, I realized that the set has the incredible property that there are no sticks that can form a triangle. If the set has two sticks of length , which are the smallest, what is the least possible length of the stick?
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.
As the first two sticks have length 1 , in order to form a triangle is required that the third stick has a length l 3 < 2 , because of Triangle Inequality. Thus, the least possible value for l 3 , that does not form a triangle with the other sticks, is 2 . Continuing with the same reasoning, we deduce that if the n t h stick has length l n and the ( n + 1 ) t h stick has length l n + 1 , then, in order to form a triangle, the ( n + 2 ) t h stick must have a length that satisfies l n + 2 < l n + 1 + l n .
As we're looking for the least possible value that does not satisfy the previous inequality, we conclude that the length of the l n + 2 stick is l n + 1 + l n . We see that this is how Fibonacci sequence is defined. Therefore, we are looking for f 1 4 , which is 3 7 7 .