This preview shows page 1. Sign up to view the full content.
Unformatted text preview: , which can be proved by recognizing that the product of ( x 1 + x 2 + + x r ) n will contain products of the type x n 1 1 x n 2 2 x n r r , and recognizing that the number of such terms, i.e. the coecient in front of this term is a count of the number of times we can select n 1 of the variable x 1 s, and n 2 of the variable x 2 , etc from the n variable choices. Since this number equals the multinomial coecient we have proven the multinomial theorem. Problem 20 (the number of ways to ll bounded urns) Let x i be the number of balls in the i th urn. We must have x i m i and we are distributing the n balls so that r i =1 x i = n . To solve this problem lets shift our variables so that each must be greater than or equal to zero. Our constraint then becomes (by subtracting the...
View Full Document
This note was uploaded on 02/25/2011 for the course STAT 418 taught by Professor G.jogeshbabu during the Winter '08 term at Pennsylvania State University, University Park.
- Winter '08