## Filters

Sort by :
Clear All
Q

Q.12 Let be defined as. Choose the correct answer.

(A) f is one-one onto

(B) f is many-one onto

(C) f is one-one but not onto

(D) f is neither one-one nor onto.

One - One : Let                                                               f is one-one.   Onto: We have  , then there exists     such that                . Hence, the function is one-one and onto. The correct answer is A .

Q.11 Let be defined as . Choose the correct answer.

(A) f is one-one onto

(B) f is many-one onto

(C) f is one-one but not onto

(D) f is neither one-one nor onto.

One- one: For     then                                                                           does not imply that  example :     and     f is not  one- one  For    there is no x in R such that    f is not onto. Hence, f is neither one-one nor onto.  Option D is correct.

Q. 10 Let and . Consider the function defined by

Let  such that                                                                                                                                                                                                                                 f is one-one. Let,        then           such that                                                                                                    ...

Q.9

Let  be defined by

for all .

,        Here we can observe,             and        As we can see   but       f is not one-one. Let,    (N=co-domain) case1   n be even    For ,          then there is  such that  case2   n be odd For  ,    then there is  such that    f is onto. f is not one-one but onto hence, the function f is not bijective.

Q. 8 Let A and B be sets. Show that such that is
bijective function.

Let  such that                                       and                        f is one- one Let,   then there exists   such that    f is onto. Hence, it is bijective.

Q.7 In each of the following cases, state whether the function is one-one, onto or

(ii)  defined by

Let  there  be    such that                                                                                                                                                                                              For      and    f is not one-one. Let there be    (-2 in codomain of R)                                              There does not exists any x in domain R  such that         ...

Q.7 In each of the following cases, state whether the function is one-one, onto or

(i)  defined by

Let  there  be    such that                                                                                                                                                                                                  f is one-one. Let there be ,                                                                            Puting value of x,                                                  ...

Q.6 Let , and let be a function
from A to B. Show that f is one-one.

Every element of A has a distant value in f. Hence, it is one-one.

Q. 5 Show that the Signum Function , given by

is neither one-one nor onto.

is given by  As we can see       ,  but  So it is not one-one. Now, f(x) takes only 3 values (1,0,-1) for the element -3 in codomain  ,there does not exists x in domain  such that . So it is not onto. Hence, signum function is neither one-one nor onto.

Q.4 Show that the Modulus Function f : R → R, given by , is neither one-one nor onto, where is  if  is positive or 0 and   is ,  if is negative.

One- one: For      then                                                                                           f is not one- one i.e. not injective. For  , We know    is always positive there is no x in R such that    f is not onto i.e. not surjective. Hence,  , is neither one-one nor onto.

Q.3 Prove that the Greatest Integer Function , given by , is neither one-one nor onto, where  denotes the greatest integer less than or equal to .

One- one: For      then      and                                      but       f is not one- one i.e. not injective. For    there is no x in R such that    f is not onto i.e. not surjective. Hence, f is not injective but not surjective.

Q.2 Check the injectivity and surjectivity of the following functions:

(v)   given by

One- one: For     then                                                                                               f is one- one i.e. injective. For    there is no x in Z such that    f is not onto i.e. not surjective. Hence, f is injective but not surjective.

Q.2 Check the injectivity and surjectivity of the following functions:

(iv)  given by

One- one:   then                                                                           f is one- one i.e. injective. For  there is no x in N such that    f is not onto i.e. not surjective. Hence, f is injective but not surjective.

Q.2 Check the injectivity and surjectivity of the following functions:

(iii)  given by

One- one: For     then                                                                          but      f is not one- one i.e. not injective. For    there is no x in R such that    f is not onto i.e. not surjective. Hence, f is not injective and not surjective.

Q.2 Check the injectivity and surjectivity of the following functions:

(ii)  given by

One- one: For     then                                                                          but      f is not one- one i.e. not injective. For    there is no x in Z such that    f is not onto i.e. not surjective. Hence, f is neither injective nor surjective.

Q.2 Check the injectivity and surjectivity of the following functions:

(i)  given by

One- one:   then                                                                           f is one- one i.e. injective. For  there is no x in N such that    f is not onto i.e. not surjective. Hence, f is injective but not surjective.

Q.1 Show that the function  defined by  is one-one and onto,
where R is the set of all non-zero real numbers. Is the result true, if the domain
R is replaced by N with co-domain being same as R?

Given,  is defined by  . One - One :                                                              f is one-one. Onto: We have  , then there exists      ( Here ) such that                . Hence, the function is one-one and onto. If the domain R∗ is replaced by N with co-domain being same as R∗   i.e.    defined by                                                                                 ...
Exams
Articles
Questions