A quadrilateral has all integer side lengths, a perimeter of , and one side of length . What is the greatest possible length of one side of this quadrilateral?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Any side of a polygon is shorter than the sum of the others, so the longest side is less than 26/2 = 13, and 12 is achievable.
Solution
In any polygon, each side must be strictly shorter than the sum of all the other sides; otherwise the other sides cannot reach around to close the figure. If the longest side has length , the other three sides sum to , so
Since is an integer, .
Now check that works with a side of length : the remaining two sides must total , for example and . The sides satisfy , so a genuine quadrilateral exists.
The answer is .
Why this works
The triangle inequality generalizes: a closed path of segments can never have one segment as long as all the rest combined. Maximum problems of this type always have two parts: bound the quantity (here ) and exhibit a configuration that reaches the bound. The given side of is a distraction that only matters for the construction step.
The trap
Answering 13 by allowing the longest side to equal the sum of the other three, which gives a degenerate flat figure.
Common mistakes
- Answering 13 by allowing the longest side to equal the sum of the other three, which gives a degenerate flat figure.
- Assuming the side of length must be the shortest side or must be adjacent to the longest side; neither constraint exists.
Techniques
Bound the quantity above/below or estimate to pin it down · Consider the largest/smallest element or boundary case