Let Z be the set of integers. If and , then the number of subsets of the set , is:
We have the set
First, recall the basic fact: for any real number the equality holds only when because the base is positive and not equal to Hence, to find all integers belonging to we must force the exponent to be zero:
This product equals zero precisely when at least one factor is zero. We split it:
1.
2.
We factor the quadratic:
So
Collecting all integer solutions, we obtain
which contains elements.
Now consider the set We solve the double inequality step by step.
First, add to every part:
Next, divide every part by (the sign of is positive, so the inequalities keep their direction):
The integers strictly between and are
Thus
with elements.
We now form the Cartesian product The counting principle tells us that
Finally, the total number of subsets of any finite set containing elements is given by the formula Substituting we get
Hence, the correct answer is Option D.
Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.