Solveeit Logo

Question

Question: How many triangles can be formed by joining the vertices of a hexagon? A. 31 B. 25 C. 20 D. ...

How many triangles can be formed by joining the vertices of a hexagon?
A. 31
B. 25
C. 20
D. 60

Explanation

Solution

As we know that hexagon has 66 vertices means 66 points and the triangle has 33 points means a triangle need 33 vertices to be formed. Then, the numbers of triangles that can be formed by joining the vertices of a hexagon can be calculated by applying the concept of combination.

Complete step by step solution:

The number of vertices in a hexagon is 66.
The number of vertices in a triangle is 33.
That means to make a triangle we need 33 vertices.
So,66is the total number of vertices in hexagons, and out of those 6 vertices, 3 vertices that being chosen at a time to make a triangle.
By applying the formula of combination:
nCr=n!r!×(nr)!{}^n{C_r} = \dfrac{{n!}}{{r! \times \left( {n - r} \right)!}} where, n is the total numbers of objects and r is the number of objects to be chosen as a time.
Therefore,
6C3=6!3!×(63)!=6!3!×(3)!{}^6{C_3} = \dfrac{{6!}}{{3! \times \left( {6 - 3} \right)!}} = \dfrac{{6!}}{{3! \times \left( 3 \right)!}}
By using the values of factorial terms:
We have, 6!6! can be written as 6×5×4×3×2×16 \times 5 \times 4 \times 3 \times 2 \times 1 and 3!3! can be written as 3×2×1.3 \times 2 \times 1.
Replace 6!6! = 6×5×4×3×2×16 \times 5 \times 4 \times 3 \times 2 \times 1 and 3!3!= 3×2×13 \times 2 \times 1 in the following equation,

6C3=6!3!×(3)! =6×5×4×3×2×13×2×1(3×2×1)=1206=20  {}^6{C_3} = \dfrac{{6!}}{{3! \times \left( 3 \right)!}} \\\ = \dfrac{{6 \times 5 \times 4 \times 3 \times 2 \times 1}}{{3 \times 2 \times 1\left( {3 \times 2 \times 1} \right)}} = \dfrac{{120}}{6} = 20 \\\

\therefore The number of triangles that can be formed by joining the vertices of a hexagon is 2020. Hence, option (C) is correct.

Note:
These types of questions always use a combination concept for solving the problem.
Some important definitions you should know
Vertices mean the point where 22 or more lines meet.
Combination: Any of the ways we can combine things when the order does not matter.
Combination formula: The formula of combination is nCr=n!r!×(nr)!{}^n{C_r} = \dfrac{{n!}}{{r! \times \left( {n - r} \right)!}}, where nn represents the number of items and rr represents the number of the items that being chosen at a time.
The factorial function(!)(!): The factorial function means to multiply all whole numbers from the chosen numbers down to 11.
The representation of factorial is n!n!.
Alternatively, you can draw the figure and count the triangles but it becomes complicated.