Q.Let . Let be the relation on defined by .
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The relation consists of all ordered pairs from where divides exactly. Writing it in roster form gives 10 pairs; the domain is and the range is .
The key idea is simple: "b is exactly divisible by a" means a divides b with no remainder — in other words, b is a multiple of a. Since both numbers come from the same small set , we can check every possible pair.
A Relation Arrow Diagram helps here. Imagine drawing two copies of set , one on the left (for the first element ) and one on the right (for ). Draw an arrow from to whenever divides . For example, 1 divides everything, so arrows go from 1 to every number. 2 divides 2, 4, and 6, so arrows go from 2 to those. 3 divides 3 and 6. 4 divides only 4. 6 divides only 6. This visual instantly shows you all the pairs — and also makes the domain and range obvious: the domain is the set of all left-side numbers that have at least one arrow leaving them, and the range is the set of all right-side numbers that have at least one arrow arriving.
Let’s now write it step by step.
-
List all pairs where divides .
For each in , find every in such that is an integer (i.e., is a multiple of ).
- : every works, so .
- : must be a multiple of 2 from → → .
- : multiples of 3 in are → .
- : multiples of 4 in are just → .
- : multiples of 6 in are just → .
So .
Watch outA common mistake is to forget that a number is always divisible by itself. Every gives at least — don’t leave those out.
-
Find the domain of . …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.