How many isosceles integer-sided triangles are there with perimeter ?
8
6
9
7
Hint 1: Let the side lengths of the isosceles triangle be , , and . The perimeter is .
Hint 2: Apply the triangle inequality: , which means . Simplify this to find the minimum value of .
Hint 3: Also remember that , which sets a maximum bound on since . Count all integer values of in this range.
Step 1: Let the sides of the triangle be , , and , where . The perimeter constraint is:
Step 2: By the triangle inequality, the sum of any two sides must be strictly greater than the third side:
Step 3: Thus, the possible integer values for are in the range . There are exactly possible values:
(sides )
(sides )
(sides )
(sides )
(sides )
(sides )
All these satisfy the triangle inequalities. So there are 6 such triangles.
Ready to track your progress and master these topics?
Create a free account