Talk:Permutations with some identical elements: Difference between revisions
Content added Content deleted
No edit summary |
(Added comment.) |
||
Line 8: | Line 8: | ||
This task is instead about creating all sequences of a finite set of elements where some elements are indistinguishable from each other. |
This task is instead about creating all sequences of a finite set of elements where some elements are indistinguishable from each other. |
||
:Yes, you're right; it is different. I've added a Go solution --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 21:27, 25 July 2019 (UTC) |
Revision as of 21:27, 25 July 2019
Duplicate of Permutations with repetitions
Seems to me this exact operation is covered by the existing (for 6 years!) Permutations_with_repetitions task. --Thundergnat (talk) 19:32, 25 July 2019 (UTC)
- I don't think so.He wants to create the permutation of different elements in which each element has its own constant multiplicity in this permutation. His example: [2,1] ( element 1 two times und element 2 1 time ) should give results (1,1,2), (1,2,1) and (2,1,1)
I don't think the permutations_with_repetitions task is about permutations at all, but rather generating all possible sequences (words) of a certain length from an alphabet, where each symbol may be repeated an infinite amount of times as needed.
This task is instead about creating all sequences of a finite set of elements where some elements are indistinguishable from each other.