Let $$A=\{n \in[100,700] \cap \mathrm{N}: n$$ is neither a multiple of 3 nor a multiple of 4$$\}$$. Then the number of elements in $$A$$ is

Let the relations $$R_1$$ and $$R_2$$ on the set $$X=\{1,2,3, \ldots, 20\}$$ be given by $$R_1=\{(x, y): 2 x-3 y=2\}$$ and $$R_2=\{(x, y):-5 x+4 y=0\}$$. If $$M$$ and $$N$$ be the minimum number of elements required to be added in $$R_1$$ and $$R_2$$, respectively, in order to make the relations symmetric, then $$M+N$$ equals

Let a relation $$\mathrm{R}$$ on $$\mathrm{N} \times \mathbb{N}$$ be defined as: $$\left(x_1, y_1\right) \mathrm{R}\left(x_2, y_2\right)$$ if and only if $$x_1 \leq x_2$$ or $$y_1 \leq y_2$$. Consider the two statements:

(I) $$\mathrm{R}$$ is reflexive but not symmetric.

(II) $$\mathrm{R}$$ is transitive

Then which one of the following is true?