Results 1 to 2 of 2

Math Help - combinatorial argument

  1. #1
    Junior Member
    Joined
    Nov 2008
    Posts
    50

    combinatorial argument

    prove that for every n>=k>=0, nCk + (n-1)Ck + (n-2)Ck + ............ + kCk = (n+1)C(k+1)

    how can i solve it using combinatorial argument and not induction or algebric proof????
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member PaulRS's Avatar
    Joined
    Oct 2007
    Posts
    571
    See here
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Combinatorial proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 10th 2009, 12:20 PM
  2. Combinatorial argument and how many intersections?
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: December 4th 2009, 04:50 PM
  3. Combinatorial Argument
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: September 25th 2009, 02:49 PM
  4. combinatorial sum
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: May 12th 2009, 10:46 AM
  5. Combinatorial argument
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: March 17th 2009, 02:46 PM

Search Tags


/mathhelpforum @mathhelpforum