Combinatorics/counting: How many configurations are possible for m differenct objects in n boxes of unlimited occupany (m<n)
Hello! The question is pretty much entirely in the title. I wasn't sure if I could just use the fundmental principle of counting here with m^n, as when I look up related formulae in statistical mechanics I get a different result.
Just to be clear:
Say there are 5 distinguishable objects and 20 distinguishable boxes. I can put up to 5 objects in a box. I am interested in how many different configurations, or states, are possible under these cirumstances.
What would change if the objects were indistinguishable?
I'm interested in a little supporting justification, just so I understand the answer. Thank you, geniuses!
- 113 views
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- Inclusion-Exclusion and Generating Function with Coefficient (and Integer Equation)
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Discrete Structures - Proving a statement true
- Discrete Structures - Proving a statement false by proving the negation to be true
- Find the generating function
- Combinatorics questions- can someone please help?
- Recursive Set