The function $f: R \rightarrow R$ is defined by $f(x)=3^{-x}$. Observe the following statements about it:
$I$. $f$ is one-one
$II$. $f$ is onto
$III$. $f$ is a decreasing function
Out of these, the true statements are:

  • A
    Only $I, II$
  • B
    Only $II, III$
  • C
    Only $I, III$
  • D
    $I, II, III$

Explore More

Similar Questions

The number of bijective functions $f: Z \rightarrow Z$ such that $f(x+y)=f(x)+f(y)$ for all $x, y \in Z$ is:

Let $f(x) = \begin{cases} -a & \text{if } -a \leq x \leq 0 \\ x+a & \text{if } 0 < x \leq a \end{cases}$ where $a > 0$ and $g(x) = \frac{f(|x|) - |f(x)|}{2}$. Then the function $g: [-a, a] \rightarrow [-a, a]$ is

Let $f : N \rightarrow N$ be defined by $f(n) = \begin{cases} \frac{n+1}{2}, & \text{if } n \text{ is odd} \\ \frac{n}{2}, & \text{if } n \text{ is even} \end{cases}$ for all $n \in N$. State whether the function $f$ is bijective. Justify your answer.

If $f: Z \rightarrow Z$, $f(x) = \begin{cases} \frac{x}{2}, & \text{if } x \text{ is even} \\ 0, & \text{if } x \text{ is odd} \end{cases}$, then $f$ is

If $f: N \rightarrow Z$ is defined by $f(n)=\begin{cases} 2 & \text{if } n=3k, k \in Z \\ 10 & \text{if } n=3k+1, k \in Z \\ 0 & \text{if } n=3k+2, k \in Z \end{cases}$, then $\{n \in N: f(n)>2\}$ 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