Combinatoricshard
0:00.0
How many ways can 10 distinct items be partitioned into 3 non-empty subsets where the order of the subsets matters? (i.e., we are counting the number of ordered partitions of a 10-element set into 3 non-empty sets).
How many ways can 10 distinct items be partitioned into 3 non-empty subsets where the order of the subsets matters? (i.e., we are counting the number of ordered partitions of a 10-element set into 3 non-empty sets).