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?

  • A
    $g \circ g \circ g = g$
  • B
    There exists an onto function $f: N \rightarrow N$ such that $f \circ g = f$
  • C
    There exists a one-one function $f: N \rightarrow N$ such that $f \circ g = f$
  • D
    There exists a function $f: N \rightarrow N$ such that $g \circ f = f$

Explore More

Similar Questions

Let $f: R \rightarrow R$ be defined by $f(x)=x^{4}$,then

The number of functions $f:[0,1] \rightarrow [0,1]$ satisfying $|f(x)-f(y)|=|x-y|$ for all $x, y \in [0,1]$ is

$f: N \rightarrow N$,is defined by $f(x)=x^6$ then, . . . . . . .

Let $f : R \to R$ be defined by $f(x) = \frac{ax^2 + ax + b}{ax + b}$. Then:

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