SOLVER7 Study. Nothing Else.
Exercise 2.2 Q5(i)

Let \(A=\{1, 2, 3, 4, 6\}.\) Let \(R\) be the relation on \(A\) defined by \(\{(a, b):a,b \in A, b\) is exactly divisible by \(a\}.\) Write \(R\) in roster form

CBSE Class 11 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a set of numbers: \( \\{1, 2, 3, 4, 6\\} \). Think of each number as a box. A smaller box fits inside a bigger box only when the bigger box is a perfect multiple of the smaller one. We make pairs like (small, big) where the big number is completely divisible by the small one, with nothing left over. For example, 2 fits into 6 because \( 6 \div 2 = 3 \) exactly. We collect all such fitting pairs to build our relation.

Answer: \[ R = \{(1,1), (1,2), (1,3), (1,4), (1,6), (2,2), (2,4), (2,6), (3,3), (3,6), (4,4), (6,6)\} \]

📖 Writing a Divisibility Relation in Roster Form

Detailed Explanation

A relation \( R \) on a set \( A \) is simply a collection of ordered pairs \( (a, b) \) where both \( a \) and \( b \) belong to \( A \). Every relation is a subset of the Cartesian product \( A \times A \). Here the rule is: \( b \) is exactly divisible by \( a \). This means when we divide \( b \) by \( a \), the remainder is \( 0 \), i.e. \( a \) is a factor of \( b \). To write \( R \) in roster form we must check every possible pair \( (a, b) \) formed from elements of \( A \) and keep only those pairs where \( a \) divides \( b \) exactly.

Formula Used

\( R = \{(a, b) : a, b \in A \text{ and } b \text{ is divisible by } a\} \subseteq A \times A \). The condition is that \( \frac{b}{a} \) is a whole number (remainder \( 0 \)).

Solution

  1. Step 1: Write down the set clearly: \( A = \{1, 2, 3, 4, 6\} \). We must form pairs \( (a, b) \) with \( a, b \in A \) where \( b \) is exactly divisible by \( a \), meaning \( a \) is a factor of \( b \).
  2. Step 2: Fix \( a = 1 \). Since every number is divisible by \( 1 \), all elements of \( A \) qualify as \( b \). This gives the pairs \( (1,1), (1,2), (1,3), (1,4), (1,6) \).
  3. Step 3: Fix \( a = 2 \). We keep \( b \) only when \( 2 \) divides \( b \). From \( A \), the multiples of \( 2 \) are \( 2, 4, 6 \). This gives \( (2,2), (2,4), (2,6) \).
  4. Step 4: Fix \( a = 3 \). We keep \( b \) only when \( 3 \) divides \( b \). From \( A \), the multiples of \( 3 \) are \( 3 \) and \( 6 \). This gives \( (3,3), (3,6) \).
  5. Step 5: Fix \( a = 4 \). We keep \( b \) only when \( 4 \) divides \( b \). From \( A \), the only multiple of \( 4 \) is \( 4 \) itself. This gives \( (4,4) \).
  6. Step 6: Fix \( a = 6 \). We keep \( b \) only when \( 6 \) divides \( b \). From \( A \), the only multiple of \( 6 \) is \( 6 \) itself. This gives \( (6,6) \).
  7. Step 7: Collect all the pairs found in Steps 2 to 6 into a single set to obtain the relation \( R \) in roster form.

Final Answer

\[ R = \{(1,1), (1,2), (1,3), (1,4), (1,6), (2,2), (2,4), (2,6), (3,3), (3,6), (4,4), (6,6)\} \]

Common Mistake

A common mistake is confusing the direction of the condition: since \( b \) is divisible by \( a \), \( a \) must be the factor (smaller or equal) and \( b \) the multiple. Students often wrongly include pairs like \( (2,3) \) or reverse pairs such as \( (4,2) \), where the second number is not a multiple of the first.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the rule: Write down the given set: \( A = \\{1, 2, 3, 4, 6\\} \). The rule says \( b \) is exactly divisible by \( a \), i.e. \( a \) is a factor of \( b \). — Reason: Knowing the elements and the condition helps us systematically check every candidate pair \( (a, b) \) without missing any.
  2. Step 2: Fix \( a = 1 \) and find valid \( b \) values: Since every integer is divisible by \( 1 \), every element of \( A \) qualifies as \( b \). The valid pairs are \( (1,1), (1,2), (1,3), (1,4), (1,6) \). — Reason: \( 1 \) is a universal factor, so no element needs to be excluded when \( a = 1 \).
  3. Step 3: Fix \( a = 2 \) and find valid \( b \) values: Check each element of \( A \) for divisibility by \( 2 \): \( 2 \div 2 = 1 \) ✓, \( 4 \div 2 = 2 \) ✓, \( 6 \div 2 = 3 \) ✓. The elements \( 1 \) and \( 3 \) are not divisible by \( 2 \), so they are excluded. Valid pairs: \( (2,2), (2,4), (2,6) \). — Reason: Only even numbers in \( A \) satisfy the divisibility condition for \( a = 2 \).
  4. Step 4: Fix \( a = 3 \) and find valid \( b \) values: Check each element of \( A \) for divisibility by \( 3 \): \( 3 \div 3 = 1 \) ✓, \( 6 \div 3 = 2 \) ✓. The elements \( 1, 2, 4 \) are not divisible by \( 3 \). Valid pairs: \( (3,3), (3,6) \). — Reason: Among the elements of \( A \), only \( 3 \) and \( 6 \) are multiples of \( 3 \).
  5. Step 5: Fix \( a = 4 \) and find valid \( b \) values: Check each element of \( A \) for divisibility by \( 4 \): \( 4 \div 4 = 1 \) ✓. The next multiple of \( 4 \) would be \( 8 \), which is not in \( A \). Valid pair: \( (4,4) \). — Reason: Only \( 4 \) itself, among the elements of \( A \), is divisible by \( 4 \).
  6. Step 6: Fix \( a = 6 \) and find valid \( b \) values: Check each element of \( A \) for divisibility by \( 6 \): \( 6 \div 6 = 1 \) ✓. No other element in \( A \) is a multiple of \( 6 \). Valid pair: \( (6,6) \). — Reason: \( 6 \) is the largest element in \( A \), so only \( 6 \) itself satisfies the condition.
  7. Step 7: Collect all valid pairs into the roster form: Combine all pairs found across Steps 2–6 to write the complete relation in roster form. — Reason: Listing all pairs together gives the final, unambiguous description of \( R \) as required by the roster (tabular) method.

Final Answer

\[ R = \{(1,1), (1,2), (1,3), (1,4), (1,6), (2,2), (2,4), (2,6), (3,3), (3,6), (4,4), (6,6)\} \]

Common Mistake

One common mistake: students forget to include the pair \( (a, a) \) for each element (e.g. omitting \( (4,4) \) or \( (6,6) \)), not realising that every number is divisible by itself, so each element must pair with itself.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( A = \{1, 2, 3, 4, 6\} \), condition: \( a \mid b \) (i.e. \( b \) is exactly divisible by \( a \)).
  2. Step 2: \( a = 1 \): \( (1,1),\ (1,2),\ (1,3),\ (1,4),\ (1,6) \). \( a = 2 \): \( (2,2),\ (2,4),\ (2,6) \).
  3. Step 3: \( a = 3 \): \( (3,3),\ (3,6) \). \( a = 4 \): \( (4,4) \). \( a = 6 \): \( (6,6) \).

Answer: \[ R = \{(1,1), (1,2), (1,3), (1,4), (1,6), (2,2), (2,4), (2,6), (3,3), (3,6), (4,4), (6,6)\} \]

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{2, 3, 5, 6, 10\} \). Let R be the relation on A defined by \( R = \{(a, b) : a, b \in A,\ b \text{ is exactly divisible by } a\} \). Write R in roster form.

Solution: We need to find all ordered pairs \( (a, b) \) with \( a, b \in A = \{2, 3, 5, 6, 10\} \) such that a divides b exactly. For \( a = 2 \): Check each element of A as b. \( b = 2 \): \( 2 \div 2 = 1 \) — divisible. Pair: \( (2, 2) \). \( b = 3 \): \( 3 \div 2 \) — not an integer. Rejected. \( b = 5 \): \( 5 \div 2 \) — not an integer. Rejected. \( b = 6 \): \( 6 \div 2 = 3 \) — divisible. Pair: \( (2, 6) \). \( b = 10 \): \( 10 \div 2 = 5 \) — divisible. Pair: \( (2, 10) \). For \( a = 3 \): Check each element of A as b. \( b = 2 \): \( 2 \div 3 \) — not an integer. Rejected. \( b = 3 \): \( 3 \div 3 = 1 \) — divisible. Pair: \( (3, 3) \). \( b = 5 \): \( 5 \div 3 \) — not an integer. Rejected. \( b = 6 \): \( 6 \div 3 = 2 \) — divisible. Pair: \( (3, 6) \). \( b = 10 \): \( 10 \div 3 \) — not an integer. Rejected. For \( a = 5 \): Check each element of A as b. \( b = 2 \): Rejected. \( b = 3 \): Rejected. \( b = 5 \): \( 5 \div 5 = 1 \) — divisible. Pair: \( (5, 5) \). \( b = 6 \): \( 6 \div 5 \) — not an integer. Rejected. \( b = 10 \): \( 10 \div 5 = 2 \) — divisible. Pair: \( (5, 10) \). For \( a = 6 \): Check each element of A as b. \( b = 2 \): Rejected. \( b = 3 \): Rejected. \( b = 5 \): Rejected. \( b = 6 \): \( 6 \div 6 = 1 \) — divisible. Pair: \( (6, 6) \). \( b = 10 \): \( 10 \div 6 \) — not an integer. Rejected. For \( a = 10 \): Check each element of A as b. \( b = 10 \): \( 10 \div 10 = 1 \) — divisible. Pair: \( (10, 10) \). All other values of b are smaller than 10 and not divisible by 10. Collecting all valid pairs, R in roster form is: \[ R = \{(2,2),\ (2,6),\ (2,10),\ (3,3),\ (3,6),\ (5,5),\ (5,10),\ (6,6),\ (10,10)\} \]

Answer: \( R = \{(2,2),\ (2,6),\ (2,10),\ (3,3),\ (3,6),\ (5,5),\ (5,10),\ (6,6),\ (10,10)\} \)

Example 2

Question: Let \( B = \{1, 2, 4, 8, 16\} \). Define a relation R on B by \( R = \{(a, b) : a, b \in B,\ b \text{ is exactly divisible by } a\} \). Write R in roster form and also state its domain and range.

Solution: We need all ordered pairs \( (a, b) \) with \( a, b \in B = \{1, 2, 4, 8, 16\} \) such that a divides b exactly. For \( a = 1 \): 1 divides every element of B. Pairs: \( (1,1),\ (1,2),\ (1,4),\ (1,8),\ (1,16) \). For \( a = 2 \): Check divisibility. \( 2 \div 2 = 1 \) — Yes: \( (2,2) \). \( 4 \div 2 = 2 \) — Yes: \( (2,4) \). \( 8 \div 2 = 4 \) — Yes: \( (2,8) \). \( 16 \div 2 = 8 \) — Yes: \( (2,16) \). \( 1 \div 2 \) — Not an integer. Rejected. For \( a = 4 \): Check divisibility. \( 4 \div 4 = 1 \) — Yes: \( (4,4) \). \( 8 \div 4 = 2 \) — Yes: \( (4,8) \). \( 16 \div 4 = 4 \) — Yes: \( (4,16) \). \( 1 \div 4 \) and \( 2 \div 4 \) — Not integers. Rejected. For \( a = 8 \): Check divisibility. \( 8 \div 8 = 1 \) — Yes: \( (8,8) \). \( 16 \div 8 = 2 \) — Yes: \( (8,16) \). \( 1, 2, 4 \) are not divisible by 8. Rejected. For \( a = 16 \): Check divisibility. \( 16 \div 16 = 1 \) — Yes: \( (16,16) \). No other element in B is divisible by 16. Therefore, R in roster form is: \[ R = \{(1,1),\ (1,2),\ (1,4),\ (1,8),\ (1,16),\ (2,2),\ (2,4),\ (2,8),\ (2,16),\ (4,4),\ (4,8),\ (4,16),\ (8,8),\ (8,16),\ (16,16)\} \] The domain of R is the set of all first elements of the pairs: \[ \text{Domain of } R = \{1, 2, 4, 8, 16\} \] The range of R is the set of all second elements of the pairs: \[ \text{Range of } R = \{1, 2, 4, 8, 16\} \]

Answer: \( R = \{(1,1),\ (1,2),\ (1,4),\ (1,8),\ (1,16),\ (2,2),\ (2,4),\ (2,8),\ (2,16),\ (4,4),\ (4,8),\ (4,16),\ (8,8),\ (8,16),\ (16,16)\} \); Domain \( = \{1,2,4,8,16\} \), Range \( = \{1,2,4,8,16\} \)

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( B = \{2, 3, 5, 6, 10\} \). Let \( R \) be the relation on \( B \) defined by \( R = \{(a, b) : a, b \in B,\; a \text{ divides } b\} \). Write \( R \) in roster form and also find the domain and range of \( R \).

Solution

  1. Step 1: List all elements of B: The set is \( B = \{2, 3, 5, 6, 10\} \). We need to check every ordered pair \( (a, b) \) where both \( a \) and \( b \) belong to \( B \), and include the pair only if \( a \) divides \( b \) exactly.
  2. Step 2: Check pairs starting with a = 2: When \( a = 2 \): Check \( b = 2 \): \( 2 \div 2 = 1 \) — yes. Check \( b = 3 \): \( 3 \div 2 \) — not exact — no. Check \( b = 5 \): \( 5 \div 2 \) — not exact — no. Check \( b = 6 \): \( 6 \div 2 = 3 \) — yes. Check \( b = 10 \): \( 10 \div 2 = 5 \) — yes. So pairs from \( a = 2 \): \( (2, 2),\; (2, 6),\; (2, 10) \).
  3. Step 3: Check pairs starting with a = 3: When \( a = 3 \): Check \( b = 2 \): \( 2 \div 3 \) — no. Check \( b = 3 \): \( 3 \div 3 = 1 \) — yes. Check \( b = 5 \): \( 5 \div 3 \) — no. Check \( b = 6 \): \( 6 \div 3 = 2 \) — yes. Check \( b = 10 \): \( 10 \div 3 \) — no. So pairs from \( a = 3 \): \( (3, 3),\; (3, 6) \).
  4. Step 4: Check pairs starting with a = 5: When \( a = 5 \): Check \( b = 2 \): no. Check \( b = 3 \): no. Check \( b = 5 \): \( 5 \div 5 = 1 \) — yes. Check \( b = 6 \): \( 6 \div 5 \) — no. Check \( b = 10 \): \( 10 \div 5 = 2 \) — yes. So pairs from \( a = 5 \): \( (5, 5),\; (5, 10) \).
  5. Step 5: Check pairs starting with a = 6: When \( a = 6 \): Check \( b = 2 \): no. Check \( b = 3 \): no. Check \( b = 5 \): no. Check \( b = 6 \): \( 6 \div 6 = 1 \) — yes. Check \( b = 10 \): \( 10 \div 6 \) — not exact — no. So pairs from \( a = 6 \): \( (6, 6) \).
  6. Step 6: Check pairs starting with a = 10: When \( a = 10 \): Check \( b = 2 \): no. Check \( b = 3 \): no. Check \( b = 5 \): no. Check \( b = 6 \): no. Check \( b = 10 \): \( 10 \div 10 = 1 \) — yes. So pairs from \( a = 10 \): \( (10, 10) \).
  7. Step 7: Write R in roster form: Combining all valid pairs: \[ R = \{(2,2),\; (2,6),\; (2,10),\; (3,3),\; (3,6),\; (5,5),\; (5,10),\; (6,6),\; (10,10)\} \]
  8. Step 8: Find the domain and range of R: The domain of \( R \) is the set of all first elements: \[ \text{Domain} = \{2, 3, 5, 6, 10\} \] The range of \( R \) is the set of all second elements: \[ \text{Range} = \{2, 6, 10, 3, 5\} = \{2, 3, 5, 6, 10\} \] In this case, the domain and range are both equal to \( B \) itself.

Answer: \[ R = \{(2,2),\; (2,6),\; (2,10),\; (3,3),\; (3,6),\; (5,5),\; (5,10),\; (6,6),\; (10,10)\} \] Domain \( = \{2, 3, 5, 6, 10\} \), Range \( = \{2, 3, 5, 6, 10\} \).

Everything you get with Solver7

More questions in Relations and Functions