Question:

Let \(f: N → N\) be defined by \(f(n) =   \begin{cases} \frac{n+1}{2} & \quad \text{if } n \text{ is odd}\\ \frac{n}{2}  & \quad \text{if } n \text{ is even} \end{cases}\) for all \(n∈N\).
State whether the function f is bijective. Justify your answer.

Updated On: Sep 2, 2023
Hide Solution
collegedunia
Verified By Collegedunia

Solution and Explanation

\(f(n) =   \begin{cases} \frac{n+1}{2} & \quad \text{if } n \text{ is odd}\\ \frac{n}{2}  & \quad \text{if } n \text{ is even} \end{cases}\) for all \(n∈N\).
It can be observed that:
\(f(1)=\frac{1+1}{2}=1\text{ and }f(2)=\frac{2}{2}=1.\)
\(\therefore f(1)=f(2), \text{ where } 1\neq2.\)
∴ f is not one-one.

Consider a natural number (n) in co-domain N.

Case I: n is odd
\(n = 2r + 1\) for some \(r ∈ N\).
Then, there exists \(4r + 1∈N\) such that
\(f(4r+1)=\frac{4r+1+1}{2}=2r+1\).

Case II: n is even
\(n = 2r\) for some \(r ∈ N\).
Then,there exists \(4r ∈N\) such that \(f(4r)=\frac{4r}{2}=2r\)
∴ f is onto.

Hence, f is not a bijective function.

Was this answer helpful?
0
0

Concepts Used:

Types of Functions

Types of Functions

One to One Function

A function is said to be one to one function when f: A → B is One to One if for each element of A there is a distinct element of B. 

Many to One Function

A function which maps two or more elements of A to the same element of set B is said to be many to one function. Two or more elements of A have the same image in B.

Onto Function

If there exists a function for which every element of set B there is (are) pre-image(s) in set A, it is Onto Function. 

One – One and Onto Function

A function, f is One – One and Onto or Bijective if the function f is both One to One and Onto function.

Read More: Types of Functions