Concept:
Number of triangles from vertices of an \( m \)-sided polygon = \( \binom{m}{3} \), since any 3 non-collinear vertices form a triangle.
Step 1: Write the given condition.
\[
T_m = \binom{m}{3}, \quad T_{m+1} = \binom{m+1}{3}.
\]
Given:
\[
\binom{m+1}{3} - \binom{m}{3} = 15.
\]
Step 2: Use the identity \( \binom{m+1}{3} - \binom{m}{3} = \binom{m}{2} \).
\[
\binom{m}{2} = 15.
\]
Step 3: Solve for \( m \).
\[
\frac{m(m-1)}{2} = 15 \quad \Rightarrow \quad m(m-1) = 30.
\]
\[
m^2 - m - 30 = 0 \quad \Rightarrow \quad (m-6)(m+5) = 0.
\]
\[
m = 6 \quad (\text{since } m > 0).
\]