Hi, I've been scratching around trying to figure out a formula for the following problem and I've got one that I think is correct. Just wondering if anyone can confirm it for certain (like maybe you have it in a text book or know it well etc). Thanks.(adsbygoogle = window.adsbygoogle || []).push({});

Problem: You need to partitionn=k*mdistinct objects intoksets each containingmobjects. How many ways can you do this?

Proposed Answer:

Number of possible distinct partitionings =n! / ( k! * (m!)^k )

(I think it's correct).

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Can anyone confirm formula (combinations)

**Physics Forums | Science Articles, Homework Help, Discussion**