If is a relation on the set of integers , then the domain of is:
First, recall that the inverse relation is obtained by interchanging the coordinates of every ordered pair of . Consequently, every first component (the “domain”) of comes from a second component of some ordered pair in . In other words,
Therefore we must determine all integer values of for which there exists at least one integer satisfying the inequality that defines , namely
We systematically test every integer value of whose square cannot make the left-hand side exceed 8.
Let us examine successive values of .
1. Take . We have , so the inequality becomes
The integer squares not exceeding 8 are . Thus the corresponding integer values of are
Since at least one such exists, appears in the range of .
2. Next take . We have , giving
The integer squares not exceeding 5 are again , so
Hence also lies in the range of .
3. Because the expression depends on , the same result holds for . Indeed, , so the identical calculation shows at least one suitable exists. Thus is present in the range of .
4. Now consider or . Here , leading to
The inequality has no integer solution because a square is always non-negative. Therefore do not belong to the range of .
5. For any , the value of is at least 12, which already exceeds 8, so no integer can satisfy the defining inequality. Thus no further values are possible.
Collecting all successful values, we obtain
Therefore
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.