Results 1 to 9 of 9

Thread: angle-diagonal connection

  1. #1
    Member
    Joined
    Dec 2017
    From
    Tel Aviv
    Posts
    146

    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 (!!!)]...
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Apr 2005
    Posts
    20,056
    Thanks
    3187

    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?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor
    Joined
    Feb 2015
    From
    Ottawa Ontario
    Posts
    2,076
    Thanks
    417

    Re: angle-diagonal connection

    Policer, Timbuktu is the capital city of ?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Member
    Joined
    Dec 2017
    From
    Tel Aviv
    Posts
    146

    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...
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor

    Joined
    Apr 2005
    Posts
    20,056
    Thanks
    3187

    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
    Follow Math Help Forum on Facebook and Google+

  6. #6
    MHF Contributor
    Joined
    Feb 2015
    From
    Ottawa Ontario
    Posts
    2,076
    Thanks
    417

    Re: angle-diagonal connection

    Quote Originally Posted by policer View Post
    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!!
    Follow Math Help Forum on Facebook and Google+

  7. #7
    MHF Contributor

    Joined
    Aug 2006
    Posts
    22,169
    Thanks
    3067
    Awards
    1

    Re: angle-diagonal connection

    Quote Originally Posted by policer View Post
    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 .
    Follow Math Help Forum on Facebook and Google+

  8. #8
    Member
    Joined
    Dec 2017
    From
    Tel Aviv
    Posts
    146

    Re: angle-diagonal connection

    Quote Originally Posted by HallsofIvy View Post
    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?
    Follow Math Help Forum on Facebook and Google+

  9. #9
    MHF Contributor
    Joined
    Feb 2015
    From
    Ottawa Ontario
    Posts
    2,076
    Thanks
    417

    Re: angle-diagonal connection

    Go away policer...
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: Oct 18th 2011, 12:45 PM
  2. matlab, diagonal of diagonal
    Posted in the Math Software Forum
    Replies: 1
    Last Post: Jan 19th 2010, 03:43 PM
  3. Replies: 4
    Last Post: Dec 9th 2009, 05:24 AM
  4. Need help with connection of theorems
    Posted in the Differential Geometry Forum
    Replies: 4
    Last Post: Nov 23rd 2009, 01:24 PM
  5. Replies: 0
    Last Post: Oct 15th 2008, 05:05 AM

/mathhelpforum @mathhelpforum