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.
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 \]
Show that the following lines intersect. Also, find their point of intersection:
Line 1: \[ \frac{x - 1}{2} = \frac{y - 2}{3} = \frac{z - 3}{4} \]
Line 2: \[ \frac{x - 4}{5} = \frac{y - 1}{2} = z \]
If \(\begin{vmatrix} 2x & 3 \\ x & -8 \\ \end{vmatrix} = 0\), then the value of \(x\) is: