Given: \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = [x] \), where \( [x] \) is the greatest integer less than or equal to \( x \).
To prove: \( f(x) = [x] \) is neither one-one nor onto.
1. Not One-One (Injective):
A function is one-one if different inputs give different outputs.
Take two real numbers: \( x = 1.2 \) and \( y = 1.9 \)
\[ f(1.2) = [1.2] = 1, f(1.9) = [1.9] = 1 \] But \( 1.2 \neq 1.9 \) and \( f(1.2) = f(1.9) \)
Therefore, \( f \) is not one-one.
2. Not Onto (Surjective):
A function is onto if every real number has a pre-image in the domain.
The function \( f(x) = [x] \) always gives an integer as output.
For example, there is no real number \( x \in \mathbb{R} \) such that \( f(x) = \pi \) or \( f(x) = 2.5 \), since the range of the function is only integers.
Therefore, all real numbers are not covered in the co-domain \( \mathbb{R} \).
Hence, \( f \) is not onto.
Conclusion: The greatest integer function \( f(x) = [x] \) is neither one-one nor onto.
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 \]
If \[ A = \begin{bmatrix} 2 & -3 & 5 \\ 3 & 2 & -4 \\ 1 & 1 & -2 \end{bmatrix}, \] find \( A^{-1} \).
Using \( A^{-1} \), solve the following system of equations:
\[ \begin{aligned} 2x - 3y + 5z &= 11 \quad \text{(1)} \\ 3x + 2y - 4z &= -5 \quad \text{(2)} \\ x + y - 2z &= -3 \quad \text{(3)} \end{aligned} \]
Four students of class XII are given a problem to solve independently. Their respective chances of solving the problem are: \[ \frac{1}{2},\quad \frac{1}{3},\quad \frac{2}{3},\quad \frac{1}{5} \] Find the probability that at most one of them will solve the problem.