\(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.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
During the festival season, a mela was organized by the Resident Welfare Association at a park near the society. The main attraction of the mela was a huge swing, which traced the path of a parabola given by the equation:\[ x^2 = y \quad \text{or} \quad f(x) = x^2 \]
Reactant ‘A’ underwent a decomposition reaction. The concentration of ‘A’ was measured periodically and recorded in the table given below:
Based on the above data, predict the order of the reaction and write the expression for the rate law.
Balance Sheet of Atharv and Anmol as at 31st March, 2024
| Liabilities | Amount (₹) | Assets | Amount (₹) |
|---|---|---|---|
| Capitals: | Fixed Assets | 14,00,000 | |
| Atharv | 8,00,000 | Stock | 4,90,000 |
| Anmol | 4,00,000 | Debtors | 5,60,000 |
| General Reserve | 3,50,000 | Cash | 10,000 |
| Creditors | 9,10,000 | ||
| Total | 24,60,000 | Total | 24,60,000 |
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