Anonymous user
Talk:Permutations with some identical elements: Difference between revisions
Talk:Permutations with some identical elements (view source)
Revision as of 21:07, 25 July 2019
, 4 years agono edit summary
m (Hopefully clarifying what is meant.) |
No edit summary |
||
Line 4:
: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)
[[User:Horst.h|Horst.h]]
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.
| |||