Prove using induction that if n∈N∪{0}, j∈N∪{0} with 0≤j≤n and X is a set with n elements,
Then the number of subsets of X which have j elements is (jn)
I've been working on this problem and get stuck when I try the inductive step. I'm not quite sure on how to start the inductive step.
Thank you in advance
Then the number of subsets of X which have j elements is (jn)
I've been working on this problem and get stuck when I try the inductive step. I'm not quite sure on how to start the inductive step.
Thank you in advance