Answer
Verified
423.9k+ 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.
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
How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE
Why Are Noble Gases NonReactive class 11 chemistry CBSE
Let X and Y be the sets of all positive divisors of class 11 maths CBSE
Let x and y be 2 real numbers which satisfy the equations class 11 maths CBSE
Let x 4log 2sqrt 9k 1 + 7 and y dfrac132log 2sqrt5 class 11 maths CBSE
Let x22ax+b20 and x22bx+a20 be two equations Then the class 11 maths CBSE
Trending doubts
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
At which age domestication of animals started A Neolithic class 11 social science CBSE
Which are the Top 10 Largest Countries of the World?
Give 10 examples for herbs , shrubs , climbers , creepers
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Difference Between Plant Cell and Animal Cell
Write a letter to the principal requesting him to grant class 10 english CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Fill in the blanks A 1 lakh ten thousand B 1 million class 9 maths CBSE