Let $A = \{1, 2, 3, 4, 5, 6, 7\}$. Then the relation $R = \{(x, y) \in A \times A : x + y = 7\}$ is :

Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x, y) \in N \times N : 2x + y = 10\}$ and $R_2 = \{(x, y) \in N \times N : x + 2y = 10\}$. Then :

Let X = {n $ \in $ N : 1 $ \le $ n $ \le $ 50}. If A = {n $ \in $ X: n is a multiple of 2} and B = {n $ \in $ X: n is a multiple of 7}, then the number of elements in the smallest subset of X containing both A and B is ________.

If $A = {x \in R : |x| < 2}$ and $B = {x \in R : |x – 2| \geq 3}$; then :

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 :