Let $A$ and $B$ be finite sets and $P_A$ and $P_B$ respectively denote their power sets. If $P_B$ has $112$ elements more than those in $P_A$,then the number of injective functions from $A$ to $B$ is

Let $S = \{ x \in \mathbb{R} : x \ge 0 \text{ and } 2|\sqrt{x} - 3| + \sqrt{x}(\sqrt{x} - 6) + 6 = 0 \}$. Then $S$:

If $A, B$ and $C$ are three sets such that $A \cap B = A \cap C$ and $A \cup B = A \cup C$,then:

$A$ two-digit number $\overline{ab}$ is called almost prime if one obtains a two-digit prime number by changing at most one of its digits $a$ or $b$. (For example,$18$ is an almost prime number because $13$ is a prime number). The number of almost prime two-digit numbers is:

If $A=\{x \in R: \sqrt{x^2-8x+15} \in R\}$ and $B=\{x \in R: \frac{x-3}{2x-5} < \frac{x-6}{2x-11}\}$,then $A \cap B=$

Let $A = \{ x \in R : [x + 3] + [x + 4] \leq 3 \}$ and $B = \{ x \in R : 3^x \left( \sum_{n=1}^{\infty} \frac{3}{10^n} \right)^{x-3} < 3^{-3x} \}$,where $[t]$ denotes the greatest integer function. Then,