Content deleted Content added
→k-permutations of n: don't use ordinary power notation for falling factorial power, use an underline to distinguish |
|||
Line 114:
:<math>\frac{11!}{1!4!4!2!}</math>.
A '''k-permutation''' of a multiset ''M'' is a sequence of length ''k'' of elements of ''M'' in which each element appears ''at most'' its multiplicity in ''M'' times (an element's ''repetition number'').
==Permutations in group theory==
|