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. Problem : You need to partition n=k*m distinct objects into k sets each containing m objects. How many ways can you do this? Proposed Answer : Number of possible distinct partitionings = n! / ( k! * (m!)^k ) (I think it's correct).