Prove that there are exactly $8100$ different ways of distributing $4$ indistinguishable black marbles and $6$ distinguishable coloured marbles ( none of them black) into $5$ distinguishable boxes in such a way that each box contains exactly $2$ marbles.
I have done problems involving indistinguishable balls and indistinguishable/distinguishable boxes, distinguishable balls and indistinguishable/distinguishable boxes.
I am confused about how to handle the situation when both indistinguishable and distinguishable balls are given at the same time.
Any hints will be helpful.
Count ways to assign black balls to the boxes – partitioned by how many boxes contain two black balls – then count ways to arrange distinguishable balls among the remaining spaces — remembering that ball placement inside a box is not ordered.
Eg: The count of ways to assign two boxes with double-black, and arrange the distinguishable balls into pairs among the remaining three boxes, is: $$\dfrac{5!}{2!\,3!}\cdotp\dfrac{6!}{2!^3}$$
Do similarly for the remaining cases.