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:

  • A
    two
  • B
    four
  • C
    zero
  • D
    infinitely many

Explore More

Similar Questions

Let $f: R \to R$ be a function defined by $f(x) = \frac{x - m}{x - n}$,where $m \ne n$. Then

Check the injectivity and surjectivity of the function $f: Z \rightarrow Z$ defined by $f(x) = x^{3}$.

Let $f: R \rightarrow R$ be a function defined by $f(x) = \begin{cases} x^2 - 4x + 3, & \text{if } x < 2 \\ x - 3, & \text{if } x \geq 2 \end{cases}$. Then the number of real numbers $x$ for which $f(x) = 8$ is:

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.

Let $f: R \rightarrow R$ be defined by $f(x) = \left\{\begin{array}{cc} 2x, & x > 3 \\ x^2, & 1 < x \leq 3 \\ 3x, & x \leq 1 \end{array}\right.$. Then,the value of $f(-2) + f(3) + f(4)$ is:

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