Sterling numbers of the First kind Combinatorial Proof

  • Thread starter Thread starter silvermane
  • Start date Start date
  • Tags Tags
    Numbers Proof
Click For Summary
SUMMARY

The discussion centers on the combinatorial proof of the Stirling numbers of the first kind, specifically the equation s(n, n-2) = 2(nC3) + 3(nC4) for n ≥ 4. The problem involves seating n individuals at n-2 circular tables, where after seating n-2 individuals, 2 individuals remain to be seated. Participants seek confirmation on their approach and solutions related to this combinatorial problem.

PREREQUISITES
  • Understanding of Stirling numbers of the first kind
  • Familiarity with combinatorial concepts such as circular permutations
  • Knowledge of binomial coefficients, specifically nCk
  • Basic skills in mathematical proof techniques
NEXT STEPS
  • Research the properties of Stirling numbers of the first kind
  • Study combinatorial proofs involving circular arrangements
  • Explore advanced topics in combinatorics, such as generating functions
  • Learn about the applications of binomial coefficients in combinatorial identities
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in combinatorial proofs and Stirling numbers.

silvermane
Gold Member
Messages
113
Reaction score
0

Homework Statement


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.

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!
 
Physics news on Phys.org
Hey, I was wondering if you figured out a solution to this and remember it? I can't figure it out at all!
 

Similar threads

Replies
1
Views
2K
Replies
7
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K