3. Let n be a positive integer and let k be an integer satisfying 0 ≤ k < n. (a) Explain what the Stirling numbers S(n, k) count. (b) Prove the formula S(n, k) = S(n − 1, k − 1) + kS(n − 1, k). 1 (c) With A = {1,2,3,4}, write down all distributions of elements of A into 2 unlabelled cells (allowing cells to be empty).

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter4: Polynomial And Rational Functions
Section4.2: Properties Of Division
Problem 50E
icon
Related questions
Question
3. Let n be a positive integer and let k be an integer satisfying 0 ≤ k <n.
(a) Explain what the Stirling numbers S(n, k) count.
(b) Prove the formula S(n, k) = S(n − 1, k − 1) + kS(n − 1, k).
1
(c) With A = {1,2,3,4}, write down all distributions of elements of A into 2 unlabelled
cells (allowing cells to be empty).
Transcribed Image Text:3. Let n be a positive integer and let k be an integer satisfying 0 ≤ k <n. (a) Explain what the Stirling numbers S(n, k) count. (b) Prove the formula S(n, k) = S(n − 1, k − 1) + kS(n − 1, k). 1 (c) With A = {1,2,3,4}, write down all distributions of elements of A into 2 unlabelled cells (allowing cells to be empty).
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell