Advertisements
Advertisements
Set of ordered pair of a function ? If so, examine whether the mapping is injective or surjective :{(a, b) : a is a person, b is an ancestor of a}
Concept: undefined >> undefined
Let A = {1, 2, 3}. Write all one-one from A to itself.
Concept: undefined >> undefined
Advertisements
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
Concept: undefined >> undefined
Show that the exponential function f : R → R, given by f(x) = ex, is one-one but not onto. What happens if the co-domain is replaced by`R0^+` (set of all positive real numbers)?
Concept: undefined >> undefined
Show that the logarithmic function f : R0+ → R given by f (x) loga x ,a> 0 is a bijection.
Concept: undefined >> undefined
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
Concept: undefined >> undefined
If A = {1, 2, 3}, show that a onto function f : A → A must be one-one.
Concept: undefined >> undefined
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Concept: undefined >> undefined
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
Concept: undefined >> undefined
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Concept: undefined >> undefined
Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.
Concept: undefined >> undefined
Suppose f1 and f2 are non-zero one-one functions from R to R. Is `f_1 / f^2` necessarily one - one? Justify your answer. Here,`f_1/f_2 : R → R is given by (f_1/f_2) (x) = (f_1(x))/(f_2 (x)) for all x in R .`
Concept: undefined >> undefined
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.
Concept: undefined >> undefined
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
Concept: undefined >> undefined
Let f : N → N be defined by
`f(n) = { (n+ 1, if n is odd),( n-1 , if n is even):}`
Show that f is a bijection.
[CBSE 2012, NCERT]
Concept: undefined >> undefined
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and g(x) = x2 + 5 .
Concept: undefined >> undefined
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + x2 and g(x) = x3
Concept: undefined >> undefined
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 8 and g(x) = 3x3 + 1 .
Concept: undefined >> undefined
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x and g(x) = |x| .
Concept: undefined >> undefined
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 2x − 3 and g(x) = 3x − 4 .
Concept: undefined >> undefined
