Let $a > 1$ and $0 < b < 1$. If $f: R \rightarrow [0, 1]$ is defined by $f(x) = \begin{cases} a^x, & -\infty < x < 0 \\ b^x, & 0 \leq x < \infty \end{cases}$,then $f(x)$ is

  • A
    $(A)$ $A$ bijection
  • B
    $(B)$ One-one but not onto
  • C
    $(C)$ Onto but not one-one
  • D
    $(D)$ Neither one-one nor onto

Explore More

Similar Questions

Let $f: R \rightarrow R$ and $g: R \rightarrow R$ be the functions defined by $f(x) = \frac{x}{1+x^2}$ and $g(x) = \frac{x^2}{1+x^2}$. Then, the correct statement$(s)$ among the following is/are:

For $A = \{-1, -2, 3, 4\}$,the number of one-one functions from $A$ to $A$ is . . . . . . .

If $f: R \rightarrow R$ is defined by $f(x)=x-[x]-\frac{1}{2}$ for $x \in R$, where $[x]$ is the greatest integer not exceeding $x$, then $\{x \in R: f(x)=\frac{1}{2}\}$ is equal to :

Let $A = \{x_1, x_2, x_3, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. Then the total number of functions $f: A \to B$ which are onto,if there exist exactly three elements $x$ in $A$ such that $f(x) = y_2$,is equal to

$A$ mapping from $\mathbb{N}$ to $\mathbb{N}$ is defined as follows: $f: \mathbb{N} \rightarrow \mathbb{N}$ where $f(n) = (n+5)^2$ for all $n \in \mathbb{N}$ (where $\mathbb{N}$ is the set of natural numbers). Then:

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