This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **has n2 elements, . .., and the rth has n r elements. The number of distinct ways in which this can be done is n!/n1!n2!. .nr!). Equivalently: Given n objects, n1 of which are of indistinguishable kind, n2 of which are of a second indistinguishable kind, . .., and nr are of rth indistinguishable kind, then the number of distinguishable permutations of the n objects is exactly n!/(n1!n2!. ..nr!)....

View
Full Document

- Fall '06
- SCHWAGER
- random sample w/o, sample w/o replacement, indistinguishable kind