Given that for any $n \in N$, there exist an odd integer $q$ and a non-negative integer $r$ such that $n$ can be written uniquely as $n = q \times 2^r$. Let $f: N \rightarrow N \times N$ be a function defined by $f(n) = \left(r+1, \frac{q+1}{2}\right)$. Then,

  • A
    $f$ is one-one but not onto
  • B
    $f$ is onto but not one-one
  • C
    $f$ is a bijection
  • D
    only $f^{-1}(1,1)$ does not exist because $f$ is not a bijection

Explore More

Similar Questions

Let $A = R - \{3\}$ and $B = R - \{1\}$. Consider the function $f: A \rightarrow B$ defined by $f(x) = \left(\frac{x-2}{x-3}\right)$. Is $f$ one-one and onto? Justify your answer.

Difficult
View Solution

Let $A = \{1, 2, 3, \ldots, 7\}$ and let $P(A)$ denote the power set of $A$. If the number of functions $f: A \rightarrow P(A)$ such that $a \in f(a)$ for all $a \in A$ is $m^n$,where $m, n \in N$ and $m$ is the least possible value,then $m + n$ is equal to . . . . . . .

If $f : R \rightarrow R$ is defined as $f(x) = x - [x] + 3$,$\forall x \in R$,then $f$ is

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:

Let $A$ and $B$ be sets. Show that $f: A \times B \rightarrow B \times A$ defined by $f(a, b) = (b, a)$ is a bijective function.

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