Question

Number of ways to put N indistinct objects into M indistinct boxes

Comments

indistinct means identical .

what do u think?

---

Thanks @Kapil ... I didn't see that ... I thought its a distinct .. :)

---

Yes, for distinct , u r right.

for indistinct or we can say indistinguishable , we simply apply partition problem.

Answer 1

A/c to Rossen there is no closed formulae for Indistinguishable object and indistinguishable box, however you can solve it by partition.

Distributing n indistinguishable objects into m indistinguishable boxes is the
same as writing n as the sum of at most k positive integers in nonincreasing order. If a 1 + a 2 +
· · · + a j = n, where a 1 , a 2 , . . . , a j are positive integers with a 1 ≥ a 2 ≥ · · · ≥ a j , we say that
a 1 , a 2 , . . . , a j is a partition of the positive integer n into j positive integers.