Results 1 to 3 of 3

Math Help - Proofs- induction in geometry

  1. #1
    Junior Member
    Joined
    Oct 2007
    Posts
    32

    Proofs- induction in geometry

    Prove that any n-gon can be cut into triangles by non-intersecting diagonals



    Prove that the number of triangles obtained by cutting an n-gon by non-intersecting diagonals is equal to n-2
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Accept induction. Pick a vertex P so that it has an adjacent vertex Q is such that PR is contained in the polygonal where R is adjacent to Q. (This is always possible). Now We have a smaller n-1 gon, which by induction is possible. Together with this triangle we have that it is always possible to "triangulate" any polygon.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Oct 2007
    Posts
    32
    Hi. I'm not sure i completely understand you proof. Can you please go into more detail?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Proofs by Induction
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: November 30th 2010, 10:11 AM
  2. Induction proofs
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: October 14th 2009, 08:32 PM
  3. proofs by induction
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: September 28th 2009, 05:29 AM
  4. Induction Proofs
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: May 5th 2009, 07:11 AM
  5. proofs by induction
    Posted in the Algebra Forum
    Replies: 7
    Last Post: September 25th 2007, 04:14 AM

Search Tags


/mathhelpforum @mathhelpforum