Answer

Verified

411.6k+ views

**Hint:**A polygon of n sides should also be having n vertices. By joining any two vertices of a polygon, we obtain either a side of that polygon or a diagonal of that polygon. So calculating with the help of permutation, by taking \[{\text{2}}\] points at a time, we get the number of lines joining all the points, then subtracting the number of edges we get the total number of diagonals.

**Complete step by step answer:**

We have to find the numbers of diagonals in the n-sided polygon.

The number of line segments obtained by joining the vertices of a n sided polygon taken two points at a time.

Now, applying the formula and using permutation as below stated.

The number of ways of selecting 2 points at a time from n number of points is given as \[^{\text{n}}{{\text{C}}_{\text{2}}}\]

As we have \[^{\text{n}}{{\text{C}}_r} = \dfrac{{n!}}{{r!\left( {n - r} \right)!}}\]

So we have

\[^{\text{n}}{{\text{C}}_{\text{2}}}{\text{ = }}\dfrac{{{\text{n!}}}}{{{\text{2!}}\left( {{\text{n - 2}}} \right){\text{!}}}}\]

On simplifying we get,

\[{ \Rightarrow ^{\text{n}}}{{\text{C}}_{\text{2}}}{\text{ = }}\dfrac{{{\text{n(n - 1)(n - 2)!}}}}{{{\text{2!}}\left( {{\text{n - 2}}} \right){\text{!}}}}\]

\[ \Rightarrow \dfrac{{{\text{n(n - 1)}}}}{{\text{2}}}\]

Hence, out of the total selections here n are the sides of the polygon so subtracting that from the total selections, we get,

\[ \Rightarrow \dfrac{{{\text{n(n - 1)}}}}{{\text{2}}} - n\]

On simplifying we get,

\[ \Rightarrow \dfrac{{{\text{n(n - 1) - 2n}}}}{{\text{2}}}\]

On taking n common from both the terms we get,

\[

\Rightarrow \dfrac{{{\text{n(n - 1 - 2)}}}}{{\text{2}}} \\

\Rightarrow \dfrac{{{\text{n(n - 3)}}}}{{\text{2}}} \\

\]

Hence , there are total \[\dfrac{{{\text{n(n - 3)}}}}{{\text{2}}}\] number of diagonals in an n sided polygon.

**Note:**: Don’t forget to subtract the number of sides while finding the number of diagonals. In geometry, a polygon is a plane figure that is described by a finite number of straight-line segments connected to form a closed polygonal chain or polygonal circuit. The solid plane region, the bounding circuit, or the two together, may be called a polygon. In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal.

Recently Updated Pages

The base of a right prism is a pentagon whose sides class 10 maths CBSE

A die is thrown Find the probability that the number class 10 maths CBSE

A mans age is six times the age of his son In six years class 10 maths CBSE

A started a business with Rs 21000 and is joined afterwards class 10 maths CBSE

Aasifbhai bought a refrigerator at Rs 10000 After some class 10 maths CBSE

Give a brief history of the mathematician Pythagoras class 10 maths CBSE

Trending doubts

Difference Between Plant Cell and Animal Cell

Give 10 examples for herbs , shrubs , climbers , creepers

Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE

Fill the blanks with the suitable prepositions 1 The class 9 english CBSE

Name 10 Living and Non living things class 9 biology CBSE

Change the following sentences into negative and interrogative class 10 english CBSE

Write a letter to the principal requesting him to grant class 10 english CBSE

Select the word that is correctly spelled a Twelveth class 10 english CBSE

Fill the blanks with proper collective nouns 1 A of class 10 english CBSE