The function $f: N \rightarrow N$ defined by $f(x) = \begin{cases} x+1, & x \text{ is odd} \\ x-1, & x \text{ is even} \end{cases}$ is . . . . . . .

  • A
    not one-one and not onto
  • B
    many-one and onto
  • C
    one-one and onto
  • D
    one-one but not onto

Explore More

Similar Questions

Consider the following statements:
Statement-$I$ : $A$ function $f: A \rightarrow B$ is said to be one-one if and only if $f(x) \neq f(y) \Rightarrow x \neq y$.
Statement-$II$ : $A$ relation $f: A \rightarrow B$ is said to be a function if $x \neq y \Rightarrow f(x) \neq f(y)$.
Then which one of the following is true?

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:

The functions which map $[-1, 1]$ to $[0, 2]$ are

Difficult
View Solution

If $P(S)$ denotes the set of all subsets of a given set $S$,then the number of one-to-one functions from the set $S = \{ 1, 2, 3 \}$ to the set $P(S)$ 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