R = {(a, b): a, b ∈ N and a = b2}
(i) It can be seen that 2 ∈ N; however, 2 ≠ 22 = 4.
Therefore, the statement “(a, a) ∈ R, for all a ∈ N” is not true.
(ii) It can be seen that (9, 3) ∈ N because 9, 3 ∈ N and 9 = 32.
Now, 3 ≠ 92 = 81; therefore, (3, 9) ∈ N
Therefore, the statement “(a, b) ∈ R, implies (b, a) ∈ R” is not true.
(iii) It can be seen that (16, 4) ∈ R, (4, 2) ∈ R because 16, 4, 2 ∈ N and 16 = 42
and 4 = 22.
Now, 16 ≠ 22 = 4; therefore, (16, 2) ∈ N
Therefore, the statement “(a, b) ∈ R, (b, c) ∈ R implies (a, c) ∈ R” is not true.
Let $ A = \{-2, -1, 0, 1, 2, 3\} $. Let $ R $ be a relation on $ A $ defined by $ (x, y) \in R $ if and only if $ |x| \le |y| $. Let $ m $ be the number of reflexive elements in $ R $ and $ n $ be the minimum number of elements required to be added in $ R $ to make it reflexive and symmetric relations, respectively. Then $ l + m + n $ is equal to
If the domain of the function $ f(x) = \log_7(1 - \log_4(x^2 - 9x + 18)) $ is $ (\alpha, \beta) \cup (\gamma, \delta) $, then $ \alpha + \beta + \gamma + \delta $ is equal to
Let A = $\{-3,-2,-1,0,1,2,3\}$. Let R be a relation on A defined by xRy if and only if $ 0 \le x^2 + 2y \le 4 $. Let $ l $ be the number of elements in R and m be the minimum number of elements required to be added in R to make it a reflexive relation. then $ l + m $ is equal to
A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.
A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.
Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.