Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Calculus and Beyond Homework Help
Exploring Number Theory: Permutations and Multiplicities
Reply to thread
Message
[QUOTE="noospace, post: 1644007, member: 78163"] 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 anyone 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. [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Calculus and Beyond Homework Help
Exploring Number Theory: Permutations and Multiplicities
Back
Top