Number theory problem

  • Thread starter noospace
  • Start date
  • #1
75
0
Hi all,

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.
 
Last edited:

Answers and Replies

Related Threads on Number theory problem

  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
1
Views
722
  • Last Post
Replies
7
Views
2K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
1
Views
471
  • Last Post
Replies
3
Views
563
  • Last Post
Replies
4
Views
849
  • Last Post
Replies
0
Views
802
  • Last Post
Replies
1
Views
2K
Top