In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is . What is the greatest possible perimeter of the triangle?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
With sides x, 3x, 15 the binding constraint is x + 15 > 3x, so x < 7.5; x = 7 gives perimeter 43.
Solution
Call the sides , , and , with a positive integer. The perimeter grows with , so we want the largest allowed by the triangle inequality.
For large the longest side is , and the sum of the other two must exceed it:
So . With the sides are : check , , , all fine.
The maximum perimeter is .
The answer is .
Why this works
Only one of the three triangle inequalities can bind when maximizing: the one where the longest side is on the big side. Identify which side is longest for the values that matter, write that inequality, and take the largest integer below the bound. The inequality is strict, so (which would give a degenerate triangle) is excluded even before integrality.
The trap
Letting 15 be the longest side (x + 3x > 15) and pushing x too large, or using x + 15 >= 3x and taking x = 7.5.
Common mistakes
- Letting 15 be the longest side (x + 3x > 15) and pushing x too large, or using x + 15 >= 3x and taking x = 7.5.
- Forgetting the sides must be integers and reporting a non-integer perimeter, or answering without adding .
Techniques
Bound the quantity above/below or estimate to pin it down