Solved: Prove Theorem 4 by first setting up a one-to-one
Chapter 5, Problem 5.5.48(choose chapter or problem)
Prove Theorem 4 by first setting up a one-to-one correspondence between permutations of n objects with ni indistinguishable objects of type i, i = 1 , 2, 3, ... , k, and the distributions of n objects in k boxes such that ni objects are placed in box i, i = 1 , 2, 3, . . . , k and then applying Theorem 3.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer