Nondegenerate has integer side lengths, is an angle bisector, , and . What is the smallest possible value of the perimeter?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The angle bisector theorem forces AB : BC = 3 : 8, so sides are 3m, 8m, 11; m = 1 is degenerate, m = 2 gives 6, 16, 11.
Solution
Since bisects , the angle bisector theorem gives
With integer sides and , this means and for some positive integer . Also .
For a nondegenerate triangle, the two shorter sides must exceed the longest. With the sides are and , which is degenerate. With the sides are : the longest is , and , so the triangle exists.
Its perimeter is .
The answer is .
Why this works
The angle bisector theorem converts a cevian condition into a ratio of sides, and "integer side lengths" plus a ratio in lowest terms forces both sides to be multiples of a common integer. The triangle inequality then rules out the tempting smallest multiple; always check it when minimizing.
The trap
Accepting m = 1 (sides 3, 8, 11) and answering 22, or forgetting the triangle inequality check and picking the wrong multiple.
Common mistakes
- Accepting m = 1 (sides 3, 8, 11) and answering 22, or forgetting the triangle inequality check and picking the wrong multiple.
- Applying the bisector ratio to the wrong pair of sides (e.g. ), which no longer uses correctly.
Techniques
Bound the quantity above/below or estimate to pin it down · Set up the equation/formula and compute; no special trick needed