The number of non-empty equivalence relations on the set ${1, 2, 3}$ is :

Let $S = {1, 2, 3, … , 100}$. The number of non-empty subsets A of S such that the product of elements in A is even 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 = {2, 3, 4}$ and $B = {8, 9, 12}$. Then the number of elements in the relation $R = {((a_1, b_1), (a_2, b_2)) \in (A \times B, A \times B) : a_1$ divides $b_2$ and $a_2$ divides $b_1}$ is :

Let $R = \{(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)\}$ be a relation on the set $A = \{3, 6, 9, 12\}$. The relation is :