Results 1 to 2 of 2

Thread: Proof help

  1. #1
    Super Member
    Feb 2008

    Proof help

    Prove that r[(r-1)Ck] = rCk(r-k)

    This may be hard to read... Prove that r times (r-1) choose k = r choose k time (r-k)

    I don't have a clue how to show this. Any help is greatly appreciated!!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Prove It's Avatar
    Aug 2008
    Just to aid in reading...

    Prove that \displaystyle r{{r-1}\choose{k}} = (r - k){r\choose{k}}.

    Surely you can prove this by evaluating the combinations using the formula

    \displaystyle {n\choose{k}} = \frac{n!}{k!(n-k)!}...
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 15
    Last Post: Jun 8th 2011, 12:13 PM
  2. Replies: 5
    Last Post: Oct 19th 2010, 11:50 AM
  3. Replies: 0
    Last Post: Jun 29th 2010, 09:48 AM
  4. Proof with algebra, and proof by induction (problems)
    Posted in the Discrete Math Forum
    Replies: 8
    Last Post: Jun 8th 2008, 02:20 PM
  5. proof that the proof that .999_ = 1 is not a proof (version)
    Posted in the Advanced Applied Math Forum
    Replies: 4
    Last Post: Apr 14th 2008, 05:07 PM

Search Tags

/mathhelpforum @mathhelpforum