$A$ relation from set $P$ to set $Q$ 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.

Let $A = \{1, 2, 3, \ldots, 10\}$ and $R$ be a relation on $A$ such that $R = \{(a, b) : a = 2b + 1\}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), \ldots, (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer $k$,for which such a sequence exists,is equal to:

Given $A = \{1, 2, 3, 4, 5\}$ and $B = \{1, 4, 5\}$. If $R$ is a relation from $A$ to $B$ such that $(x, y) \in R$ with $x > y$,then the range of $R$ is:

If $A$ is the set of even natural numbers less than $8$ and $B$ is the set of prime numbers less than $7$,then the number of relations from $A$ to $B$ is

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