Anonymous user
Talk:Solve hanging lantern problem: Difference between revisions
m
→Duplicate of Permutations with some identical elements?
(→Duplicate of Permutations with some identical elements?: new section) |
|||
Line 19:
I believe this task is essentially equivalent to [[Permutations with some identical elements]]. You can see this in the solutions to this task that output "Sequence as column numbers". They basically treat the different columns as different elements 1..n, and the number of lanterns in each column as the repetitions of the same element. And what they are calculating is basically all the distinct ways to permute all those elements (which represents all the distinct orders you can choose column numbers to pick lanterns from). This can easily be translated into "lantern numbers" if desired, because it is always the case that the first lantern picked from a particular column is the bottommost lantern in that column, the second is the second bottommost, etc.
If you take the given example in this task (a column of 1, a column of 2, an column of 3), and translate it to [[Permutations with some identical elements]], with 1 element of A, 2 elements of B, 3 elements of C, you see that you will get 60 results, just like the result here.
-- [[User:Spoon!|Spoon!]] ([[User talk:Spoon!|talk]]) 23:42, 18 June 2022 (UTC)
| |||