I. The number of elements in R is 17
II. R is an equivalence relation
The set is defined as $S = \{-2, -1, 0, 1, 2\}$.
The relation R on $S \times S$ is defined by the condition $(a, b) \in R$ if and only if $1 + ab > 0$. We need to check two statements about this relation.
We systematically list all pairs $(a, b)$ from $S \times S$ where $1 + ab > 0$. The total number of pairs in $S \times S$ is $5 \times 5 = 25$. Let's check the condition for each element $a \in S$:
The total number of elements in R is the sum of pairs found: $3 + 3 + 5 + 3 + 3 = 17$. Therefore, Statement I is true.
For R to be an equivalence relation, it must be reflexive, symmetric, and transitive.
Check if $(a, a) \in R$ for all $a \in S$. This requires $1 + a \cdot a > 0$, which is $1 + a^2 > 0$. Since $a^2 \ge 0$ for any real number $a$, $1 + a^2$ is always greater than 0. Thus, R is reflexive.
Check if $(a, b) \in R$ implies $(b, a) \in R$. If $1 + ab > 0$, does $1 + ba > 0$? Since multiplication is commutative ($ab = ba$), the condition $1 + ab > 0$ is equivalent to $1 + ba > 0$. Thus, R is symmetric.
Check if $(a, b) \in R$ and $(b, c) \in R$ implies $(a, c) \in R$. Let's test this:
Since we found a case where $(a, b) \in R$ and $(b, c) \in R$ but $(a, c) \notin R$, the relation R is not transitive.
Because R is not transitive, it is not an equivalence relation. Statement II is false.
Based on the analysis, only Statement I is true, while Statement II is false.
Let f and g be functions satisfying $f(x+y) = f(x)f(y), f(1) = 7$ and $g(x+y) = g(xy), g(1) = 1$, for all $x, y \in \mathbb{N}$. If $\sum_{x=1}^{n} \left(\frac{f(x)}{g(x)}\right) = 19607$, then n is equal to :
Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.