1. ## angle-diagonal connection

THERE IS a CONNECTION between angle to diagonals in every polygon?

Can so you say why YES? why NOT? ... [(!!!!!!!!)]

[And don't ask me about capital city of country like the flatland, for example (!!!)]...

2. ## Re: angle-diagonal connection

first. a polygon with n>3 vertices has n- 3 diagonals at every vertex and they all make different angles with a side. Which do you mean?

3. ## Re: angle-diagonal connection

Policer, Timbuktu is the capital city of ?

4. ## Re: angle-diagonal connection

Let start.
To DenisB:
Timbuktu is the capital city of district that call also Timbuktu.
Timbuktu is in a country that its name Mali that the capital city is Bamako.
Nineveh is capital city of Assyrian in a region that call Mesopotamia...
To my matters:
I think of the relation that one diagonal divide the angle to two angles [x, big_angle - x].
If I add all the diagonals so that all the diagonal of the polygon is draw, how many angles can I get?
Are there more connection except what I said...

5. ## Re: angle-diagonal connection

In a polygon with n vertices we have "diagonals" from each point except itself and its two neighbors. So each point has n- 3 diagonals ending at it. With n vertices that would be a total of n(n-3) diagonals except that, of course, each diagonal has two endpoints- so the actual number of diagonals is n(n-3)/2. (A quadrilateral, with 4 vertices, has 4(1)/2= 2 diagonals, a pentagon 5(2)/2= 5 diagonals, a hexagon 6(3)/2= 9 diagonals, etc.5

6. ## Re: angle-diagonal connection

Originally Posted by policer
To DenisB:
Timbuktu is the capital city of district that call also Timbuktu.
The two finalists were a Yale graduate and a redneck.
The final contest was for them to make a poem in 2 minutes
containing a word that would be given to them by the judges.
The word was "TIMBUKTU".
The Yale graduate was the first to give his poem:

Slowly across the desert sand,
Trekked a lonely caravan.
Men on camels two by two,
Destination Timbuktu.

The audience went wild. They thought the redneck would
never stand a chance against him-a YALE graduate.
Nevertheless, the redneck stood up and gave his poem:

Me and Tim a hunting went,
Met three whores in a pop-up tent.
They were three and we were two,
So I bucked one and Timbuktu.

The audience gave him a standing ovation!!

7. ## Re: angle-diagonal connection

Originally Posted by policer
THERE IS a CONNECTION between angle to diagonals in every polygon? Can so you say why YES? why NOT? ... [(!!!!!!!!)] [And don't ask me about capital city of country like the flatland, for example (!!!)]...
Surely over the last eleven months someone else (maybe Denis) has figured out that policer is a troll .

8. ## Re: angle-diagonal connection

Originally Posted by HallsofIvy
In a polygon with n vertices we have "diagonals" from each point except itself and its two neighbors. So each point has n- 3 diagonals ending at it. With n vertices that would be a total of n(n-3) diagonals except that, of course, each diagonal has two endpoints- so the actual number of diagonals is n(n-3)/2. (A quadrilateral, with 4 vertices, has 4(1)/2= 2 diagonals, a pentagon 5(2)/2= 5 diagonals, a hexagon 6(3)/2= 9 diagonals, etc.5
I know where I was doing wrong:
I think that there is a way to approximate the size of angle and its diagonals but it isn't possible because the length as in other OP isn't defined so that isn't possible.
Can somebody can If I right...
The angle has size but the length of any diagonal hasn't size.
Right?

9. ## Re: angle-diagonal connection

Go away policer...