Number of triangles formed by joining the vertices of the polygon = Number of selections of 3 points from n points
= nC3 = n(n - 1)(n - 2)/3.2.1
Let the vertices of the polygon be marked as A1 , A2 , A3 , …, An .
(i) Select two consecutive vertices A1 , A2 of the polygon. For the required triangle, we can select the third vertex from the points A4 , A5 , …, An–1. This can be done in n–4C1 ways. Also two consecutive points (end points of a side of polygon) can be selected in n ways. Hence, the total number of required triangles = n n–4C1 = n(n – 4).
(ii) For the required triangle, we have to select three consecutive vertices of the polygon, that is, (A1 A2 A3 ), (A2 A3 A4), (A3 A4 A5), …, (An A1 A2). This can be done in n ways.
(iii) Triangles having no side common + Triangles having exactly one side common + Triangles having exactly two sides common (with those of the polygon)
= Total number of triangles formed
⇒ Triangles having no side common with those of the polygon