Ten segments. One can form a triangle.

In summary, the conversation discusses the conditions for selecting three sides of a triangle among ten segments with integer lengths greater than 1cm and less than 55cm. It is proven that this is possible by arranging the lengths in a non-decreasing order and considering a super Fibonacci sequence, leading to a contradiction if the claim is false.
  • #1
caffeinemachine
Gold Member
MHB
816
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
  • #2
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
 
  • #3
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.
 
  • #4
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:
  • #5
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.
 

FAQ: Ten segments. One can form a triangle.

What do the ten segments represent in this statement?

The ten segments represent the sides or edges of a shape or figure.

How many segments are needed to form a triangle?

A minimum of three segments are needed to form a triangle.

Can all ten segments be used to form a triangle?

No, not all ten segments can be used to form a triangle. Only three segments can be used at a time to form a triangle.

What is the relationship between the number of segments and the type of triangle formed?

The number of segments used will determine the type of triangle formed. For example, using three segments will form a triangle, while using four segments will form a quadrilateral.

Are there any other shapes that can be formed with ten segments?

Yes, there are other shapes that can be formed with ten segments, such as a pentagon, hexagon, or decagon.

Similar threads

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