Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

Consider the the number of distinct permutations of a collection of [itex]N[/itex] objects having multiplicities [itex]n_1,\ldots,n_k[/itex]. Call this F.

Now arrange the same collection of objects into [itex]k[/itex] bins, sorted by type. Consider the set of permutations such that the contents of any one bin after permutation are the same.

Can anyone help to convince me that the number of permutations which achieve this is also F? I believe that this is probably true but I'm unable to show it.

I've read elsewhere that [itex]F = N!/(n_1!\cdots n_k!)[/itex] which provides a starting point, but I'm not sure where to go from here.

**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!

# Homework Help: Number theory problem

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

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