If $f: S \rightarrow R$ where $S$ is the set of all non-singular matrices of order $2$ over $R$ and $f\left(\begin{bmatrix} a & b \\ c & d \end{bmatrix}\right) = ad - bc$, then:

  • A
    $f$ is a bijective mapping
  • B
    $f$ is one-one but not onto
  • C
    $f$ is onto but not one-one
  • D
    $f$ is neither one-one nor onto

Explore More

Similar Questions

Let $f: N \to N$ be defined by $f(x) = x^2 + x + 1$,where $x \in N$. Then $f$ is:

Let $X$ be a set with exactly $5$ elements and $Y$ be a set with exactly $7$ elements. If $\alpha$ is the number of one-one functions from $X$ to $Y$ and $\beta$ is the number of onto functions from $Y$ to $X$,then the value of $\frac{1}{5!}(\beta-\alpha)$ is. . . . . .

The function $f: R \rightarrow R$ is defined by $f(x)=3^{-x}$. Observe the following statements about it:
$I$. $f$ is one-one
$II$. $f$ is onto
$III$. $f$ is a decreasing function
Out of these, the true statements are:

Prove that the function $f: R \rightarrow R$,defined by $f(x)=2x$,is one-one and onto.

The set $A$ has $4$ elements and the set $B$ has $5$ elements. Then,the number of injective mappings that can be defined from $A$ to $B$ 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