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 = {2, 3, 4, 5, ....., 30}$ and '$\simeq$' be an equivalence relation on $A \times A$, defined by $(a, b) \simeq (c, d)$, if and only if $ad = bc$. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4, 3)$ is equal to :

An organization awarded $48$ medals in event 'A', $25$ in event 'B' and $18$ in event 'C'. If these medals went to total $60$ men and only five men got medals in all the three events, then, how many received medals in exactly two of three events?

Let a relation $R$ on $N \times N$ be defined as: $(x_1, y_1) R (x_2, y_2)$ if and only if $x_1 \le x_2$ or $y_1 \le y_2$. Consider the two statements: (I) $R$ is reflexive but not symmetric. (II) $R$ is transitive Then which one of the following is true?

Let $A=\{0,3,4,6,7,8,9,10\}$ and $R$ be the relation defined on $A$ such that $R=\{(x, y) \in A \times A: x-y$ is odd positive integer or $x-y=2\}$. The minimum number of elements that must be added to the relation $R$, so that it is a symmetric relation, is equal to ____________.