\(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.
LIST I | LIST II | ||
A. | Range of y=cosec-1x | I. | R-(-1, 1) |
B. | Domain of sec-1x | II. | (0, π) |
C. | Domain of sin-1x | III. | [-1, 1] |
D. | Range of y=cot-1x | IV. | \([\frac{-π}{2},\frac{π}{2}]\)-{0} |
What is the Planning Process?
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.
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.
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.
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