Number of Triangles/Diagonals Formed in a Polygon with n Sides
Quantitative Aptitude › Geometry – Quadrilaterals and Polygons · Topic 17.9
A polygon with n sides can be split into n minus 2 triangles by drawing diagonals from one vertex, and the number of triangles that can be formed by joining any three of its vertices is n(n - 1)(n - 2)/6. The number of diagonals is n(n - 3)/2.
5 min read · Quantitative Aptitude · Geometry – Quadrilaterals and Polygons
Quick Answer
A polygon with n sides can be split into n minus 2 triangles by drawing diagonals from one vertex, and the number of triangles that can be formed by joining any three of its vertices is n(n – 1)(n – 2)/6. The number of diagonals is n(n – 3)/2.
At a Glance
- Triangulation n – 2 triangles from one vertex
- All triangles n(n – 1)(n – 2)/6
- With two polygon sides n
- With exactly one side n(n – 4)
- With no polygon side n(n – 4)(n – 5)/6
- Diagonals n(n – 3)/2
Where Does It Fit?
This topic completes the polygon counting started in Number of Diagonals in a Polygon and uses the triangle count n – 2 from Sum of Interior Angles and Exterior Angles of Polygons. The combination formula comes from Combination and Selection Problems.
How Many Triangles Can Be Formed From the Vertices?
In short: any three vertices form a triangle, so the total count is the number of ways of choosing 3 from n vertices.
Triangle counts
- Total triangles = n(n – 1)(n – 2)/6, which is C(n, 3).
- Triangles with all three sides as sides of the polygon: none, unless n = 3.
- Triangles with exactly two sides of the polygon: n (a vertex and its two neighbours).
- Triangles with exactly one side of the polygon: n(n – 4).
- Triangles with no side of the polygon: n(n – 4)(n – 5)/6.
| n | Total | Two sides | One side | No side |
|---|---|---|---|---|
| 6 | 20 | 6 | 12 | 2 |
| 7 | 35 | 7 | 21 | 7 |
| 8 | 56 | 8 | 32 | 16 |
| 10 | 120 | 10 | 60 | 50 |
In every row, the three kinds of triangles add up to the total.
How Does Triangulation Differ From Counting All Triangles?
In short: triangulation splits the polygon into non-overlapping triangles, while counting all triangles chooses any three vertices.
- Triangulation: a polygon with n sides always splits into exactly n – 2 triangles using diagonals that do not cross. A hexagon splits into 4.
- All triangles: these overlap and share sides, so their number is much larger. A hexagon has 20.
- Diagonals: a polygon has n(n – 3)/2 diagonals, and a diagonal can be a side of a triangle with one or two diagonal sides.
- Use: triangulation gives the angle sum (n – 2) × 180°, as in Sum of Interior Angles and Exterior Angles of Polygons.
How Do You Work Backwards From the Count?
In short: find n from the given count, then apply the needed formula.
| Given | Step to find n | n |
|---|---|---|
| Diagonals = 20 | n(n – 3) = 40, so n = 8 | 8 |
| Triangles = 56 | n(n – 1)(n – 2) = 336, so n = 8 | 8 |
| Triangles = 35 | n(n – 1)(n – 2) = 210, so n = 7 | 7 |
| Triangles with exactly one side = 32 | n(n – 4) = 32, so n = 8 | 8 |
Try three consecutive integers whose product matches n(n – 1)(n – 2), such as 8, 7 and 6 for 336.
Solved Examples
Example 1
Question: How many triangles can be formed by joining the vertices of a heptagon?
- n = 7.
- Total = 7 × 6 × 5 / 6 = 35.
Answer: 35 triangles.
Example 2
Question: In a regular polygon with 8 sides, how many triangles have exactly one side common with the polygon?
- n(n – 4) = 8 × 4.
Answer: 32 triangles.
Example 3
Question: How many triangles formed from the vertices of a decagon have no side in common with the decagon?
- n(n – 4)(n – 5)/6 = 10 × 6 × 5/6.
- = 50.
Answer: 50 triangles.
Example 4
Question: A polygon has 20 diagonals. In how many ways can a triangle be drawn using its vertices?
- n(n – 3) = 40 gives n = 8.
- Triangles = 8 × 7 × 6/6.
Answer: 56 triangles.
Shortcuts and Tricks
- Total triangles are C(n, 3). Compute it as n(n – 1)(n – 2)/6.
- For the sub-counts, remember n, n(n – 4) and n(n – 4)(n – 5)/6.
- Check the sum of the three kinds equals the total.
- For a diagonal count given, first find n, then use the triangle formula.
- Triangulation always gives n – 2 triangles.
Common Mistakes
- Using n – 2 as the total count of triangles.
- Forgetting to divide by 6 in the combination formula.
- Using n(n – 3) instead of n(n – 4) for one-side triangles.
- Counting two-side triangles as 2n.
- Mixing up triangles formed with diagonals counted.
Practice Questions
- How many triangles can be formed from the vertices of a pentagon?
- How many triangles in a nonagon have exactly one side common with it?
- How many triangles formed by the vertices of a 12-sided polygon have no side in common with it?
- A polygon has 14 diagonals. Find the number of triangles formed by its vertices.
- Into how many triangles can a 15-sided polygon be divided from one vertex?
Answers: 1) 10; 2) 45; 3) 112; 4) 35; 5) 13.
Why Is This Topic Important?
- Foundation It links geometry with counting.
- Exam use Triangle count questions appear in SSC CGL.
- Speed Four formulas cover every case.
- Link It uses combinations from Combination and Selection Problems.
What Comes Next?
The next macro is Area and Perimeter of Triangle (Including Heron’s Formula), which begins the study of area and perimeter of plane figures.
Key Terms and Formulas
- Triangulation Splitting a polygon into triangles by diagonals
- C(n, 3) Number of ways to choose 3 vertices
- Vertex A corner of the polygon
- Diagonal Segment joining non-adjacent vertices
- Common side A side shared by the triangle and the polygon
- Combination A selection without regard to order
Related Topics
- Properties of a Cyclic Trapezium
- Properties of Square, Rectangle, Parallelogram, Rhombus and Trapezium
- Properties of Regular and Irregular Polygons
- Sum of Interior Angles and Exterior Angles of Polygons
Exam Corner
Points to Remember
- Triangulation gives n – 2 triangles.
- All triangles = n(n – 1)(n – 2)/6.
- Two polygon sides: n triangles.
- One polygon side: n(n – 4) triangles.
- No polygon side: n(n – 4)(n – 5)/6 triangles.
Do Not Confuse With
- n – 2 vs C(n, 3) n – 2 is triangulation; C(n, 3) counts all triangles.
- Diagonals vs triangles n(n – 3)/2 against n(n – 1)(n – 2)/6.
- One side vs no side Different formulas.
- Two sides vs one side n against n(n – 4).
Memory Hook
Pick any three vertices: n choose three triangles.
GS Relevance
Frequently Asked Questions
How many triangles can be formed from the vertices of an n-sided polygon?
The number of triangles that can be formed by joining any three vertices of an n-sided polygon is n times (n minus 1) times (n minus 2) divided by 6. A heptagon gives 35 triangles and a decagon gives 120 triangles.
How many triangles does triangulation of a polygon give?
Triangulating an n-sided polygon by drawing diagonals from one vertex gives exactly n minus 2 triangles that do not overlap. A hexagon splits into 4 triangles, and this count leads to the interior angle sum of (n minus 2) times 180 degrees.
How many triangles have exactly one side common with the polygon?
The number of triangles formed from the vertices of an n-sided polygon that have exactly one side common with the polygon is n times (n minus 4). For an octagon this is 8 times 4, which equals 32.
How many triangles have no side common with the polygon?
The number of triangles formed from the vertices that have no side common with the polygon is n(n - 4)(n - 5)/6. For a decagon this is 10 times 6 times 5 divided by 6, which equals 50 triangles.
How are triangle counts and diagonals related?
The three kinds of triangles, with two polygon sides, one side and no side, add up to the total of n(n - 1)(n - 2)/6. Diagonals, counted by n(n - 3)/2, are the segments that appear as non-polygon sides in those triangles, so the two counts are linked by the same vertices.
PYQ Practice — Statement Analysis
1 A polygon with n sides can be triangulated into n - 2 triangles.
Draw all diagonals from one vertex.
2 The number of triangles formed from the vertices of a heptagon is 35.
7 × 6 × 5/6 = 35.
3 The number of triangles with exactly two sides common with an n-gon is 2n.
It is n.
4 In a decagon, 50 triangles formed from its vertices have no side in common with it.
10 × 6 × 5/6 = 50.
Related Topics
Browse the full Quantitative Aptitude index