Take any non-empty subset of and unite it with any subset of .
That will be one of your required subsets.
What do you get?
I am totally guessing at this one.
Let k and n be positive integers satisfying k < n. How many subsets of [n] are not also subsets of [k]?
Take k=2 and n=3, then
[3] = { } {1} {2} {3} {1,2} {1,3} {2,3} {1,2,3}
[2] = { } {1} {2} {1,2}
The cardinality of [3] = and the cardinality of [2] = . The number of subsets of [3] that are not subsets of [2] = - .
So I think the number of subsets of [n] that are not also subsets of [k] would be - . Is this correct?
OK, I had to go back and review set theory again.
First I made a mistake with { }. It should just be .
I see the algebra of exponents gives the same answer that I originally came up with .
Also when you unite any non-empty subset of [k] with [n]\[k] you still get [n]\[k]. I suppose the only reason to go to all that trouble would be to eliminate the null set?
Trying to use the force, but this little green guy keeps whacking me with his light saber!