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
Unformatted text preview: The number of permutations of n objects, where there are n 1 indistinguishable objects of type 1, n 2 indistinguishable objects of type 2, . .., and n k indistinguishable objects of type k such that n 1 +n 2 +...+n k = n, Distributing objects into boxes Many counting problems can be solved by enumerating the ways objects can be placed into boxes, where the order of placing objects within a box does not matter. There are four possibilities. we will look at placing distinguishable objects into distinguishable boxes (DODB) and indistinguishable objects into distinguishable boxes (IODB). Theorem 4. The number of ways to distribute n distinguishable objects into k distinct boxes so that n i objects are placed in box i, i=1, . .., k, and n 1 +...+n k = n, is Distinguishable objects into distinguishable boxes (DODB) Example : count the number of 5card poker hands for 4 players in a game. Assume that a standard deck of cards is used....
View
Full
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