But just how is this formula derived? exactly how would I desire to begin deriving this formula?
For each vertex $n $(vertices) you have actually $(n-3)$ possible vertices to produce a diagonal line from.
Why $(n-3)$? because you can"t combine with the 2 neighboring vertices and you can"t incorporate with your existing vertex. Division by two due to the fact that you are counting twice. Therefore you have actually $frac(n-3)n2$ diagonals.
You are watching: Formula for number of diagonals in a polygon
We can solve this by using combination, to make diagonals we require to choose no. Of pairs of 2 vertices that deserve to be created from $n$ vertices i.e $$ dbinomn2$$ us will get the answer, however we must subtract $n$ from it since adjacent vertices cannot do a diagonal.$ herefore$ the last answer is $$dbinomn2-n= dfrac(n-1)n-2n2=dfracn(n-3)2.$$
Thanks because that contributing an answer to yellowcomic.comematics Stack Exchange!Please be sure to answer the question. Provide details and share her research!
But avoid …Asking for help, clarification, or responding to other answers.Making statements based on opinion; back them increase with referrals or an individual experience.
Use yellowcomic.comJax to style equations. yellowcomic.comJax reference.
See more: What Do Ferns Have Instead Of Seeds ? Ferns & Flowering Plants
To learn more, check out our tips on writing good answers.
article Your prize Discard
Not the answer you're feather for? Browse various other questions tagged geometry or ask your very own question.
How many pairs that diagonals of of a odd sided continuous polygon crossing within the internal the polygon?
Maximum number of acute triangle in a continuous convex polygon triangulated into $n-2$ triangles by that is diagonals.
site style / logo © 2021 stack Exchange Inc; user contributions license is granted under cc by-sa. Rev2021.11.11.40730