If , , and is the set of all integers, then the number of subsets of the set is _________.
We begin by translating each set description into interval form on the real number line.
For set we have the condition . The definition of absolute value gives the equivalence
Simplifying each inequality,
Hence
For set the requirement is Because the square-root function is non-negative, we square both sides, knowing the direction of the inequality will not change:
This rearranges to
Therefore
For set we are given . Using the same absolute-value definition,
which simplifies to
Thus
Now we find the intersection . Writing the two interval unions together,
On the left half-line , the part common with is the portion further restricted by , giving On the right half-line , every point already satisfies , so the whole interval survives. Consequently
Next we intersect this result with :
The interval of obviously lies inside of , so it remains unchanged. The interval meets only where , giving Therefore
We now form the complement of this set inside . Using the fact that the complement of a union is the union of complements, we remove both pieces from the real line:
Here is included because it was not in the intersection (the first interval was open at ), while is excluded because it was contained in the intersection (the second interval was closed at ).
To finish, we intersect with , the set of all integers. The integers lying in are
We count their number:
The question asks for the number of subsets of this finite set. A fundamental result of set theory states that a set with elements has distinct subsets (including the empty set and the set itself). Substituting , we get
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.