Let $A = \{1, 2, 3\}$. The total number of distinct relations that can be defined over $A$ is

$A = \{1, 2, 3, 5\}$ and $B = \{4, 6, 9\}$. Define a relation $R$ from $A$ to $B$ by $R = \{(x, y) : \text{the difference between } x \text{ and } y \text{ is odd}; x \in A, y \in B\}$. Write $R$ in roster form.

Let $X = \{ 1, 2, 3, 4, 5 \}$ and $Y = \{ 1, 3, 5, 7, 9 \}$. Which of the following is a relation from $X$ to $Y$?

Let $n(A) = n$. Then the total number of relations on $A$ is:

If $R$ is a relation from a finite set $A$ having $m$ elements to a finite set $B$ having $n$ elements,then the number of relations from $A$ to $B$ is:

Let $A = \{1, 2, 3, 4, 6\}$. 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.