Results 1 to 2 of 2

Math Help - problem in combinatorics

  1. #1
    Newbie
    Joined
    Aug 2011
    Posts
    11

    problem in combinatorics

    a regular polygon has n sides.how many triangles can be drawn using the vertices,but not the sides?
    i thought that the solution is 20C3 but it is not.could you please explain.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,536
    Thanks
    778

    Re: problem in combinatorics

    20C3 is the total number of triangles, including those that use the polygon's sides. You need to subtract such triangles. For this it is convenient to count separately the number of triangles that use exactly one or exactly two of polygon's sides.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Combinatorics problem
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: October 11th 2010, 11:52 AM
  2. a combinatorics problem
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: July 23rd 2010, 03:39 AM
  3. Help with combinatorics problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: September 25th 2009, 08:21 AM
  4. Combinatorics Problem
    Posted in the Statistics Forum
    Replies: 1
    Last Post: March 30th 2008, 05:11 AM
  5. Combinatorics Problem
    Posted in the Discrete Math Forum
    Replies: 9
    Last Post: March 5th 2008, 08:29 AM

Search Tags


/mathhelpforum @mathhelpforum