
Describe the relationship between the number of sides and the number of diagonals of a polygon.
Answer
623.7k+ views
Hint: - A polygon is simply a plain figure enclosed by straight lines.
Diagonal: A line segment in a polygon that joins two non-consecutive vertices.
With the help of above 2 statements one can deduce the relationship between the number of sides and no of diagonals.
Complete step by step answer:
Let consider a regular polygon of $n$ vertices.
Since, to make diagonal we need to choose number of pairs of two vertices that can be formed from $n$vertices i.e.
$ \Rightarrow _{}^n{C_2}$ eq.1
But one thing to be noted here we need to subtract $n$ from eq.1 since adjacent vertices cannot make a diagonal
Then, eq.1 becomes
$
\Rightarrow {\text{ }}_{}^n{C_2} - n \\
\Rightarrow {\text{ }}\dfrac{{n!}}{{2!(n - 2)!}}{\text{ }} - {\text{ }}n \\
\Rightarrow {\text{ }}\dfrac{{n(n - 1)}}{2}{\text{ }} - n \\
\Rightarrow {\text{ }}\dfrac{{n(n - 1) - 2n}}{2} \\
{\text{On taking }}n{\text{ common from expression}} \\
\Rightarrow {\text{ }}\dfrac{{n(n - 3)}}{2}{\text{ }} \\
$
Hence, the relation between the number of sides and the number of diagonals of a polygon
Is $\dfrac{{n(n - 3)}}{2}$.
Note: -Whenever you get this kind of question the key concept is to find a result that you have knowledge about polygons, diagonals. You need to know about basic properties of polygon, diagonals like to form a diagonal; two non-consecutive vertices are required.For eg:A triangle has 3 vertices therefore n=3, no of diagonals will be 3(3-3)/2=0. hence this can be implied to polygon of any no of sides.
Diagonal: A line segment in a polygon that joins two non-consecutive vertices.
With the help of above 2 statements one can deduce the relationship between the number of sides and no of diagonals.
Complete step by step answer:
Let consider a regular polygon of $n$ vertices.
Since, to make diagonal we need to choose number of pairs of two vertices that can be formed from $n$vertices i.e.
$ \Rightarrow _{}^n{C_2}$ eq.1
But one thing to be noted here we need to subtract $n$ from eq.1 since adjacent vertices cannot make a diagonal
Then, eq.1 becomes
$
\Rightarrow {\text{ }}_{}^n{C_2} - n \\
\Rightarrow {\text{ }}\dfrac{{n!}}{{2!(n - 2)!}}{\text{ }} - {\text{ }}n \\
\Rightarrow {\text{ }}\dfrac{{n(n - 1)}}{2}{\text{ }} - n \\
\Rightarrow {\text{ }}\dfrac{{n(n - 1) - 2n}}{2} \\
{\text{On taking }}n{\text{ common from expression}} \\
\Rightarrow {\text{ }}\dfrac{{n(n - 3)}}{2}{\text{ }} \\
$
Hence, the relation between the number of sides and the number of diagonals of a polygon
Is $\dfrac{{n(n - 3)}}{2}$.
Note: -Whenever you get this kind of question the key concept is to find a result that you have knowledge about polygons, diagonals. You need to know about basic properties of polygon, diagonals like to form a diagonal; two non-consecutive vertices are required.For eg:A triangle has 3 vertices therefore n=3, no of diagonals will be 3(3-3)/2=0. hence this can be implied to polygon of any no of sides.
Recently Updated Pages
Master Class 10 English: Engaging Questions & Answers for Success

Master Class 10 Social Science: Engaging Questions & Answers for Success

Master Class 10 Computer Science: Engaging Questions & Answers for Success

Class 10 Question and Answer - Your Ultimate Solutions Guide

Master Class 10 General Knowledge: Engaging Questions & Answers for Success

Master Class 10 Maths: Engaging Questions & Answers for Success

Trending doubts
A boat goes 24 km upstream and 28 km downstream in class 10 maths CBSE

State and explain Ohms law class 10 physics CBSE

Distinguish between soap and detergent class 10 chemistry CBSE

a Why did Mendel choose pea plants for his experiments class 10 biology CBSE

What is a "free hit" awarded for in limited-overs cricket?

Draw the diagram of the sectional view of the human class 10 biology CBSE

