Let a set $A = A_1 \cup A_2 \cup ..... \cup A_k$, where $A_i \cap A_j = \phi$ for $i \neq j$, $1 \le j, j \le k$. Define the relation R from A to A by $R = \{(x, y) : y \in A_i$ if and only if $x \in A_i, 1 \le i \le k\}$. Then, R is :

The minimum number of elements that must be added to the relation $R = \{(a, b), (b, c)\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is :

Let $A = {1, 2, 3, ..., 100}$ 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), ..., (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 :

Let $A=\{1,2,3,4,5,6,7\}$. Define $B=\{T \subseteq A$ : either $1 \notin T$ or $2 \in T\}$ and $C=\{T \subseteq A: T$ the sum of all the elements of $T$ is a prime number $\}$. Then the number of elements in the set $B \cup C$ is ________________.

Let $R$ be the real line. Consider the following subsets of the plane $R \times R$: $S = {(x, y) : y=x+1 ext{ and } 0