MHB Ten segments. One can form a triangle.

  • Thread starter Thread starter caffeinemachine
  • Start date Start date
  • Tags Tags
    Form Triangle
AI Thread Summary
The discussion focuses on proving that among ten segments with integer lengths between 1cm and 55cm, three can be selected to form a triangle. It suggests that the conditions can be relaxed to include lengths greater than or equal to 1cm. The argument involves sorting the lengths and assuming the claim is false, leading to a super Fibonacci sequence where the maximum length contradicts the upper limit of 55cm. The conclusion drawn is that it's impossible to select three segments that do not form a triangle under the given conditions. The reasoning highlights the importance of the triangle inequality in this context.
caffeinemachine
Gold Member
MHB
Messages
799
Reaction score
15
Each of ten segments has integer length and each one's length is greater than 1cm and less than 55cm. Prove that you can select three sides of a triangle among the segments.
 
Mathematics news on Phys.org
caffeinemachine said:
Each of ten segments has integer length and each one's length is greater than 1cm and less than 55cm. Prove that you can select three sides of a triangle among the segments.

Is the wording right? It looks like you can relax the conditions to the lengths being greater than or equal 1cm and less than 55cm.

CB
 
CaptainBlack said:
Is the wording right? It looks like you can relax the conditions to the lengths being greater than or equal 1cm and less than 55cm.

CB

I think you are right. I've taken this from a book and in the book they have the conditions I have posted.
 
caffeinemachine said:
I think you are right. I've taken this from a book and in the book they have the conditions I have posted.

Sorting the lengths into non-decreasing order, and assume that the claim is false, then the ordered sequence of lengths is a super Fibonacci sequence, meaning that:

\[ l_{k} \ge l_{k-1}+l_{k-2}, k=3, .., 10 \]

Thus the set of lengths which has the smallest maximum value such that three may not be selected to form a triangle is the Fibonacci sequence, but then \(l_{10}\ge 55\), a contradiction.

(note I regard the degenerate triangle with two zero angles as a non-triangle, the argument is easily modified if you want this to count as a triangle)

CB
 
Last edited:
CaptainBlack said:
Sorting the lengths into non-decreasing order, and assume that the claim is false, then the ordered sequence of lengths is a super Fibonacci sequence, meaning that:

\[ l_{k} \ge l_{k-1}+l_{k-2}, k=3, .., 10 \]

Thus the set of lengths which has the smallest maximum value such that three may not be selected to form a triangle is the Fibonacci sequence, but then \(l_10\ge 55\), a contradiction.

(note I regard the degenerate triangle with two zero angles as a non-triangle, the argument is easily modified if you want this to count as a triangle)

CB
Nice.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...

Similar threads

Replies
1
Views
2K
Replies
1
Views
1K
Replies
3
Views
1K
Replies
1
Views
1K
Replies
4
Views
2K
Replies
2
Views
2K
Replies
30
Views
5K
Replies
1
Views
3K
Back
Top