Set has elements and set has elements. If the total number of subsets of is 112 more than the total number of subsets of , then the value of is___.
We have two finite sets, set with elements and set with elements.
First, we state the basic formula: for any set containing elements, the total number of its subsets is . This is because each element can be either “chosen” or “not chosen”, giving two possibilities per element and hence possibilities in all.
Applying this formula to the two given sets, the number of subsets of is and the number of subsets of is .
We are told that
To handle the difference of two powers of two, we isolate the common factor on the right hand side. Subtracting from both sides and then factoring gives
Let us introduce a new positive integer defined by . Because gives a positive difference, we have . Substituting into the previous expression, we get
The integer can be written in its prime-factor form:
This factorisation tells us that any power of two dividing must be at most , so we must have and therefore (since is a non-negative integer).
Now we test each possible value of from to , computing the corresponding value of and checking whether it is an integer power of two.
• If , then and
which is not a power of two. So is impossible.
• If , then and
and is not a power of two. So is impossible.
• If , then and
but is not a power of two. So is impossible.
• If , then and
and is not a power of two. So is impossible.
• If , then and
Because is indeed a power of two, this case works with . Therefore
Now that we have and , we compute the required product:
So, the answer is .
Tagged Sets, subsets, power sets and set operations. Machine-assigned, so read it as a strong shortlist rather than a verdict.