Explanation:
It is given that A = {1, 2, 3, 4, 6} and R is a relation on A such that R = {(a, b) : a, b ∈ A and b is exactly divisible by a}
The given R can be re-written in roaster form as 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)}.
As we know, Range (R) = {b: (a, b) ∈ R}
Therefore, range (R) = {1, 2, 3, 4, 6} = A∈ n(A) = 5
Hence, the correct option is (D).
Let $R$ be a relation defined on the set $\{1,2,3,4\times\{1,2,3,4\}$ by \[ R=\{((a,b),(c,d)) : 2a+3b=3c+4d\} \] Then the number of elements in $R$ is
Let \(M = \{1, 2, 3, ....., 16\}\), if a relation R defined on set M such that R = \((x, y) : 4y = 5x – 3, x, y (\in) M\). How many elements should be added to R to make it symmetric.
Consider the following two reactions A and B: 
The numerical value of [molar mass of $x$ + molar mass of $y$] is ___.
Consider an A.P. $a_1,a_2,\ldots,a_n$; $a_1>0$. If $a_2-a_1=-\dfrac{3}{4}$, $a_n=\dfrac{1}{4}a_1$, and \[ \sum_{i=1}^{n} a_i=\frac{525}{2}, \] then $\sum_{i=1}^{17} a_i$ 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.
