How many non-congruent triangles with perimeter have integer side lengths?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The longest side must be less than half the perimeter, so it is 3; the other two sides sum to 4, giving only (3,3,1) and (3,2,2).
Solution
Let the sides be integers with . The triangle inequality is equivalent to , so . Since three sides of at most must total , and is too small, the longest side is exactly .
Then with : either or .
Both triples and satisfy , so there are exactly non-congruent triangles.
The answer is .
Why this works
For integer-sided triangles with a given perimeter, the only real constraint is the triangle inequality, and it is cleanest to apply to the longest side: it must be less than half the perimeter. Bounding the largest side first shrinks the search to a couple of cases.
The trap
Listing every way to write 7 as three positive integers and forgetting the triangle inequality, which admits (1,1,5) and (1,2,4).
Common mistakes
- Listing every way to write 7 as three positive integers and forgetting the triangle inequality, which admits (1,1,5) and (1,2,4).
- Counting orderings such as and separately; congruent triangles count once.
Techniques
Bound the quantity above/below or estimate to pin it down · Organized listing / direct enumeration