Shelbie has been asked to construct as many unique triangles as she can that have all sides of integer length, one side of lengt

Question

SpyIntel [72]

3 years ago

11

Shelbie has been asked to construct as many unique triangles as she can that have all sides of integer length, one side of lengt

h 5 cm, and a perimeter less than or equal to 16 cm.

Mathematics

1 answer:

Yuliya22 [10] · Answer 1 · 2022-03-28T21:34:46+03:00

Answer:

TOTAL NO TRIANGLE = 15 ;

Step-by-step explanation:

Here one side is fixed as 5 cm.

And the Perimeter is ≤ 15 .

PERIMETER = SUM OF ALL SIDES.

By keeping one side fixed and varying other two, we can get 15 no of triangles.

(5 cm,5 cm,6 cm) , (5 cm,5 cm,5 cm) ,( 4 cm,5 cm, 7 cm) (4 cm,5 cm,5 cm), (4 cm,5 cm,6 cm) , (3 cm,4 cm,5 cm) , (3 cm,5 cm,5 cm) , (3 cm,5 cm,6 cm) , (3 cm,5 cm,7 cm) , (4 cm,4 cm,5 cm) , (1 cm,5 cm,5 cm) , (2 cm,4 cm,5 cm) , (2 cm,5 cm,5 cm) , (2 cm,5 cm,6 cm) , (3 cm,3 cm,5 cm)