Prove that the Greatest Integer Function $f: R \rightarrow R$,given by $f(x)=[x]$,is neither one-one nor onto,where $[x]$ denotes the greatest integer less than or equal to $x$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) The function is defined as $f: R \rightarrow R$ where $f(x) = [x]$.
To check for one-one:
Consider $f(1.2) = [1.2] = 1$ and $f(1.9) = [1.9] = 1$.
Since $f(1.2) = f(1.9)$ but $1.2 \neq 1.9$,the function is not one-one.
To check for onto:
The range of the greatest integer function is the set of all integers $Z$.
Since the codomain is $R$ and the range $Z \subset R$,there exist elements in the codomain (e.g.,$0.7$) that have no pre-image in the domain.
For example,there is no $x \in R$ such that $f(x) = 0.7$ because $[x]$ must be an integer.
Therefore,the function is not onto.
Hence,the greatest integer function is neither one-one nor onto.

Explore More

Similar Questions

Let $f : R \rightarrow R$ be a function such that $f(x) = \frac{x^2+2x+1}{x^2+1}$. Then

$f(x) = x + \sqrt{x^2}$ is a function from $R \to R$,then $f(x)$ is

$A$ function from $A = \{x : -1 \leq x \leq 1\}$ to itself which is not a bijection is

If $f(x) = [8x] - 3$,where $[x]$ is the greatest integer function of $x$,then $f(\pi) = $

The number of onto functions $f$ from $\{1, 2, 3, \dots, 20\}$ to $\{1, 2, 3, \dots, 20\}$ such that $f(k)$ is a multiple of $3$ whenever $k$ is a multiple of $4$ is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo