Count k-length ordered selections from n distinct items without reuse—the nPk partial permutation
Count multisets of size k from n types when the same element may appear more than once
Count unordered k-subsets from n distinct items without replacement—the binomial n choose k
Count permutations of multiset objects when symbols repeat within fixed-length patterns
Count ordered arrangements of n distinct items taken all at once—the factorial n! formula