What is the number of all set permutations in a power set?
For a set of size n, the size of its power set is 2^n. Generate all
permutations for each element of the power set. The power set for set {a,
b} is {{}, {a}, {b}, {a,b}}. Generate all permutations on each set, we can
get {(),(a),(b),(a,b),(b,a)}. So the number of all subset permutation for
a power set generated from a 2-element set is 5. And such a number for a
3-item set is 16. Is there a formula for this number defined in terms of
n?
No comments:
Post a Comment