If $f: Z \rightarrow N$ is defined by $f(n) = \begin{cases} 2n, & \text{if } n > 0 \\ 1, & \text{if } n = 0 \\ -2n-1, & \text{if } n < 0 \end{cases}$, then the function $f$ is:

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

Explore More

Similar Questions

Are $f$ and $g$ both necessarily onto,if $g \circ f$ is onto?

Let $A$ be a set containing $10$ distinct elements. Then the total number of distinct functions from $A$ to $A$ is:

The number of functions $f: \{1, 2, \ldots, 100\} \rightarrow \{0, 1\}$ that assign $1$ to exactly one of the positive integers less than or equal to $98$ is equal to $\qquad$.

Let $f: R \to R$ be defined as $f(x) = x^3$. Then $f$ is . . . . . . .

Let $g: N \rightarrow N$ be defined as
$g(3n+1)=3n+2$
$g(3n+2)=3n+3$
$g(3n+3)=3n+1, \text{ for all } n \geq 0$
Then which of the following statements is true?

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