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
CBSE Class 11 Maths · Relations and Functions
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)\} \]
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.
\( 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 \)).
\[ 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)\} \]
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.
\[ 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)\} \]
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.
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)\} \]
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)\} \)
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\} \)
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 \).
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\} \).