ExamBro
ExamBro
AP EAMCET · Maths · Functions

How many bijections \(f: \mathbf{Z} \rightarrow \mathbf{Z}\) are there such that \(f(x+y)=f(x)+f(y)\) for all \(x, y \in \mathbf{Z}\) ?

  1. A One
  2. B Two
  3. C Three
  4. D Infinitely many
Verified Solution

Answer & Solution

Correct Answer

(D) Infinitely many

Step-by-step Solution

Detailed explanation

\(f: \mathrm{Z} \rightarrow \mathbf{Z}\) \(\begin{aligned} & f(x+y)=f(x)+f(y) ; x, y \in \mathbf{Z} \\ & \therefore \quad f(x)=k x \\ \end{aligned}\) So, there are infinitely many bijections