Let a function $f: N \rightarrow N$ be defined by
$f(n) = \begin{cases} 2n, & n = 2, 4, 6, 8, \dots \\ n-1, & n = 3, 7, 11, 15, \dots \\ \frac{n+1}{2}, & n = 1, 5, 9, 13, \dots \end{cases}$
Then,$f$ is

  • A
    one-one but not onto
  • B
    onto but not one-one
  • C
    neither one-one nor onto
  • D
    one-one and onto

Explore More

Similar Questions

The mapping $f: R \to R$ defined as $f(x) = \cos x, x \in R$ is:

Let $A = \{1, 2, 3, \ldots, n\}$ and $B = \{a, b\}$. If the number of onto functions from $A$ to $B$ is $62$,then the number of subsets of $A$ containing exactly three elements is:

$f: N \rightarrow N, f(x) = x^3$ is . . . . . . .

The number of onto functions from the set $\{1, 2, \ldots, 11\}$ to the set $\{1, 2, \ldots, 10\}$ is

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 . . . . . . .

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