Let $R$ denote the set of all real numbers and $R^{+}$ denote the set of all positive real numbers. For the subsets $A$ and $B$ of $R$, define $f: A \rightarrow B$ by $f(x) = x^2$ for $x \in A$. Match the following lists:
| Column $I$ | Column $II$ |
| :--- | :--- |
| $A$. $f$ is one-one and onto, if | $1$. $A = R^{+}, B = R$ |
| $B$. $f$ is one-one but not onto, if | $2$. $A = B = R$ |
| $C$. $f$ is onto but not one-one, if | $3$. $A = R, B = R^{+}$ |
| $D$. $f$ is neither one-one nor onto, if | $4$. $A = B = R^{+}$ |

  • A
    Option A
  • B
    Option B
  • C
    Option C
  • D
    Option D

Explore More

Similar Questions

Let $f(x) = x^{12} - x^9 + x^4 - x + 1$. Which of the following is true?

The number of roots of the equation $\sqrt{2}+e^{\cosh^{-1} x}-e^{\sinh^{-1} x}=0$ is

Function $f(x) = \sin x + \tan x + \operatorname{sgn}(x^2 - 6x + 10)$ is (where $\operatorname{sgn}$ is the signum function):

Let $A = \{1, 4, 7\}$ and $B = \{2, 3, 8\}$. Then the number of elements in the relation $R = \{((a_1, b_1), (a_2, b_2)) \in ((A \times B) \times (A \times B)) : a_1 + a_2 \text{ divides } b_2 + b_1\}$ is . . . . . . .

Let $S = \{1, 2, 3, 4, 5, 6, 7\}$. Then the number of possible functions $f: S \rightarrow S$ such that $f(m \cdot n) = f(m) \cdot f(n)$ for every $m, n \in S$ and $m \cdot n \in S$ is equal to $......$

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo