An infinite number are possible.
It is possible to divide a hexagon into 4 or more - up to infinitely many - triangles.
A polyhedron with two congruent triangles. There are very many possible configurations.
You have to specifically give the problem with the dots, but it can form all equilateral triangles.. .. . .. . . .
A triangle has 6 parts ... 3 sides and 3 angles. It's possible for two triangles to have as many as 3 of their parts congruent, and the triangles still not be congruent.
An infinite number are possible.
It is possible to divide a hexagon into 4 or more - up to infinitely many - triangles.
There are 16 possible triangles.
A polyhedron with two congruent triangles. There are very many possible configurations.
33 triangles
The least number of obtuse triangles, if all possible triangles are drawn for n points in a plane, is zero. If all the n points lie in a straight line, no triangles are possible and so no obtuse triangles are able to be drawn; thus for any number n, there is a possibility that no obtuse triangles can be drawn, so the least possible number of obtuse triangles drawn is zero.
You have to specifically give the problem with the dots, but it can form all equilateral triangles.. .. . .. . . .
if you need to know how many triangles are in a polygon ... just take the number of its sides and subtract for example. nonagon has 9 sides so it will be 9-2=7 so, a nonagon has 7 triangles
i dont know because its to give you that answer
a pyramid can use any triangles possible.
A triangle has 6 parts ... 3 sides and 3 angles. It's possible for two triangles to have as many as 3 of their parts congruent, and the triangles still not be congruent.
There are with infinitely many possible dimensions for triangles with a given area.