Class 12 Relations DPP Solutions
Class 12 Relations DPP Solutions
The inverse relation R−1 is {(8, 11), (10, 13)}. By reversing the initial relation y = x - 3 to x = y + 3, we identify associations that are viable pairs, which are (8, 11) and (10, 13). The elements 12 in set B do not have a corresponding pair in set A .
The relation is reflexive and transitive but not symmetric. Reflexivity is satisfied as for each element in A, there is a pair (x, x) in R except for '2' where it's added; transitivity holds as pairs align logically; however, symmetry is not satisfied because, for example, (1, 2) does not have (2, 1).
The range of R is {1}. This is determined by observing that in the condition 'x is greater than y', no element from set A (1, 2, 3) is greater than 4, 6, or 9, making only 1 from set B satisfying the condition for x = 2 or 3, where x > y. Therefore, the only element from set B that satisfies the condition is 1 .
The correct statement is (d) iϕ1, because the modulus |i| equals 1. For any complex number x = a + bi, the modulus |x| = √(a² + b²). Choosing (2 + 3i) or (1 + i) doesn't yield 13 or 2, respectively, as their moduli .
The relation R = {(2, 3)} is transitive. A relation is considered transitive if for any elements aRb and bRc, we have aRc; since there's no such sequence leading to any contradictions or necessary additional pairs, it's considered transitive. It is not symmetric because for (2, 3) we don't have (3, 2).
The domain of R is {2, 3, 4, 5}. This is determined by checking the condition of being relatively prime for each pair (x, y) in the Cartesian product A × B. A number x is relatively prime to y if their greatest common divisor (GCD) is 1. For set A, each element has at least one relatively prime counterpart in set B .
The relation is transitive. The transitive property requires that if (1, 2) and (2, 3) are in R, then a related pair (1, 3) should also be in R, which indeed it is. No additional elements contradict the transitivity within this set .
The relation R is reflexive as it contains (a, a), (b, b), and (c, c) for each element in A. However, it is not symmetric because the presence of (a, b) requires (b, a) to also be present for symmetry, which is not the case .
The domain of R is {2, 4, 6}. This equation does not define a reflexive relation because for reflexivity, each pair (x, x) should hold, which isn't satisfied as it involves two different variables x and y. Calculating possible x values by setting 8 − 2y = x, only x values 2, 4, and 6 satisfy when y is a natural number .
The relation R is an equivalence relation because it satisfies reflexivity ((1,1), (2,2), (3,3)), symmetry (for every (x, x), x is related to itself trivially), and transitivity (since there are no non-matching pairs, the condition is vacuously satisfied). These three properties make it an equivalence relation .