1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Sterling numbers of the First kind Combinatorial Proof

  1. Apr 17, 2010 #1

    silvermane

    User Avatar
    Gold Member

    1. The problem statement, all variables and given/known data
    Say we have sterling numbers of the first kind where we're given s(n, n-2) = 2(nC3) + 3(nC4)
    for n greater than or equal to 4.

    3. The attempt at a solution
    So, for the left side, we have n people, and we wish to seat them at n-2 circular tables, where if we first seat n-2 people, we'll have 2 remaining people to sit down at any of the n-2 circular tables. I just want to know if I'm on the right track here; thank you so much for your time!
     
  2. jcsd
  3. Apr 19, 2012 #2
    Hey, I was wondering if you figured out a solution to this and remember it? I can't figure it out at all!
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Sterling numbers of the First kind Combinatorial Proof
  1. Combinatorial proof? (Replies: 2)

  2. Combinatorial Proof (Replies: 2)

  3. Combinatorial Proof? (Replies: 4)

  4. Combinatorial Proof (Replies: 1)

Loading...