This preview shows pages 1–8. Sign up to view the full content.
Indistinguishable objects into distinguishable boxes (IODB)
Similar to combinations with repetitions. For example, consider the previously solved science fair problem.
Three schools  A, B and C  are competing for a grand prize in a science fair competition. There are two
judges. Each judge, anonymously, recommends one of the two schools. Calculate the number of ways the
judges recommend the schools.
Here, we can view
n  schools as distinguishable boxes
r  anonymous recommendations as indistinguishable objects
n boxes => n1 bars separate them
r objects => when placed you have some sequence of r objects and n1 bars
Therefore, the problem is similar to constructing (n1+r)bit strings with exactly r zeros (objects).
Theorem 5.
The number of ways to place r indistinguishable objects into n distinct boxes is
10/25/11
How many terms are there in the expansion of (x+y)
n
?
How many terms are there in the expansion of (x+y+z)
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 03/21/2012 for the course CS 3333 taught by Professor Boppana during the Fall '11 term at The University of Texas at San Antonio San Antonio.
 Fall '11
 Boppana

Click to edit the document details