Total number of coupons = k as there is 1 coupon in each box.
Let the number of first type of coupon be X1, second type of coupon be X2 and so on till Xn as the number of coupons which is nth type of coupon.
Therefore, we have here:
X1 + X2 + ...... + Xn = k
As each one of them could be greater than or equal to 0. The total number of solutions here is given using the multinomial formula as:
Also given that we want the number of each type of coupon to be at least 1, therefore the number of solutions in that case is computed using the multinomial formula as:
Therefore the required probability here is computed as:
This is the required probability here.
Get Answers For Free
Most questions answered within 1 hours.