The theorem present in the wiki for permutation with repetition is for the case where all the objects need to be ordered. What if I have to order some objects?
Specifically, what is the formula for number of ways to arrange objects out of objects which consists of objects of type 1, objects of type 2, ... objects of type such that ?
Building on the Lisa example in the above wiki, if a constraint is that she has only place for 4 ornaments on the mantle, then what are number of ways to arrange the ornaments?
My thought is that we need to do casework kind of solution and no general formula exists. Would love to hear your thoughts.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.