For talented mathematicians......?

0 ⤊

For talented mathematicians......?

Does anyone know of a geometric theorem relating the number of diagonals, in a polygon, to the number of sides. Any help would be greatly appreciated as im completely clueless.

2007-01-21 06:32:37 · 2 answers · asked by Anonymous in Science & Mathematics ➔ Mathematics

2 answers

ok each summit has 2 neighbours so N-3 diagonals, where N is the number of sides. Since a diagonal has 2end points, you get
N(N-3) /2.

2007-01-21 06:37:48 · answer #1 · answered by gianlino 7 · 0⤊ 0⤋

A diagonal is the line joining two ver tices that are not consecutive
THE SIDES JOIN TWO CONSECUTIVE VERTICES
number of diagonals = Combination of n vertices taken by 2 minus n( number of sides

D= n(n-1)/2 - n =( n^2-3n)/2

2007-01-21 15:02:41 · answer #2 · answered by santmann2002 7 · 0⤊ 0⤋