Let T(n, r) be the number of ways to put n different balls into r different bins with no bin empty. We have initial conditions T(0,0) = 1, T(n,0) = 0 for n > 1, T(n, 1n) = n!. (1) Arguing similarly to our proof of Pascal's Identity, show that T(n, r) = rT(n – 1,r – 1) +rT(n – 1,r) for 0

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Let T(n, r) be the number of ways to put n different balls into r different bins
with no bin empty. We have initial conditions T(0,0) = 1, T(n,0) = 0 for n > 1,
T(n, 1n) = n!.
(1) Arguing similarly to our proof of Pascal's Identity, show that
T(n, r) = rT(n – 1,r – 1) +rT(n – 1,r)
for 0 <r< n.
IHint: Use the Sum Rule depending on whether there is a bin that has the
largest number n by itself, or not.
(b) Compute a table of T(n, r) for 0 < n,r < 4.
Transcribed Image Text:Let T(n, r) be the number of ways to put n different balls into r different bins with no bin empty. We have initial conditions T(0,0) = 1, T(n,0) = 0 for n > 1, T(n, 1n) = n!. (1) Arguing similarly to our proof of Pascal's Identity, show that T(n, r) = rT(n – 1,r – 1) +rT(n – 1,r) for 0 <r< n. IHint: Use the Sum Rule depending on whether there is a bin that has the largest number n by itself, or not. (b) Compute a table of T(n, r) for 0 < n,r < 4.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,