|
I pulled this question from my college stats book. Figured it'd be a good way to refresh before the test.
The explanation fromthe book Labelled Theorem 1.8
The number of ways in which a set of n distinct objects can be partitioned into k subsets with n1 objects in the first subset, n2 objects in the second subset, .... and nk objects in the kth subset is
(N!)/(n1!*n2!*nk!)
Hope this explanation adds on to what GmatG has stated...
it's amazing how simple the problem is from the solution, yet how complicated it seems when reading the question....
Big thanks for all the help.
Not sure how to source this..here's the book I'm using...
John E. Frend's
Mathematical Statistics 6th Edition
Irwin Miller/Marylees Miller. Husband Wife??? (Just Imagine there discussions over dinner trying to stump one another...)
Copyright 1999 Prentice Hall
ISBN 0-13-123613-X
|