Advertisements
Advertisements
प्रश्न
If f(x) = sin x and g(x) = 2x be two real functions, then describe gof and fog. Are these equal functions?
Advertisements
उत्तर
We know that
f : R→ [−1, 1] and g : R→ R
Clearly, the range of f is a subset of the domain of g.
gof : R→ R
(gof) (x) = g (f (x))
= g ( sin x)
= 2 sin x
Clearly, the range of g is a subset of the domain of f.
fog : R → R
So, (fog) (x) = f (g (x))
= f (2x)
= sin (2x)
Clearly, fog ≠ of
APPEARS IN
संबंधित प्रश्न
Let f: R → R be the Signum Function defined as
f(x) = `{(1,x>0), (0, x =0),(-1, x< 0):}`
and g: R → R be the Greatest Integer Function given by g(x) = [x], where [x] is greatest integer less than or equal to x. Then does fog and gof coincide in (0, 1]?
Give an example of a function which is not one-one but onto ?
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x2 + x
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
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 .`
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + x2 and g(x) = x3
Let A = {a, b, c}, B = {u v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Consider f : {1, 2, 3} → {a, b, c} and g : {a, b, c} → {apple, ball, cat} defined as f (1) = a, f (2) = b, f (3) = c, g (a) = apple, g (b) = ball and g (c) = cat. Show that f, g and gof are invertible. Find f−1, g−1 and gof−1and show that (gof)−1 = f −1o g−1
Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → B, g : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.
Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1
Let A = R - {3} and B = R - {1}. Consider the function f : A → B defined by f(x) = `(x-2)/(x-3).`Show that f is one-one and onto and hence find f-1.
[CBSE 2012, 2014]
Let f : R `{- 4/3} `- 43 →">→ R be a function defined as f(x) = `(4x)/(3x +4)` . Show that f : R - `{-4/3}`→ Rang (f) is one-one and onto. Hence, find f -1.
If f : A → A, g : A → A are two bijections, then prove that fog is a surjection ?
If f : {5, 6} → {2, 3} and g : {2, 3} → {5, 6} are given by f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, then find fog. [NCERT EXEMPLAR]
\[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, then
The function
f : A → B defined by
f (x) = - x2 + 6x - 8 is a bijection if
Let
f : R → R be given by
\[f\left( x \right) = \left[ x^2 \right] + \left[ x + 1 \right] - 3\]
where [x] denotes the greatest integer less than or equal to x. Then, f(x) is
(d) one-one and onto
The range of the function
\[f\left( x \right) =^{7 - x} P_{x - 3}\]
If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\]
If the function
\[f : R \to R\] be such that
\[f\left( x \right) = x - \left[ x \right]\] where [x] denotes the greatest integer less than or equal to x, then \[f^{- 1} \left( x \right)\]
If \[F : [1, \infty ) \to [2, \infty )\] is given by
\[f\left( x \right) = x + \frac{1}{x}, then f^{- 1} \left( x \right)\]
Let A = ℝ − {3}, B = ℝ − {1}. Let f : A → B be defined by \[f\left( x \right) = \frac{x - 2}{x - 3}, \forall x \in A\] Show that f is bijective. Also, find
(i) x, if f−1(x) = 4
(ii) f−1(7)
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(a, b): a is a person, b is an ancestor of a}
Let the function f: R → R be defined by f(x) = cosx, ∀ x ∈ R. Show that f is neither one-one nor onto
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
f = {(1, 4), (1, 5), (2, 4), (3, 5)}
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
k = {(1,4), (2, 5)}
Let A = R – {3}, B = R – {1}. Let f: A → B be defined by f(x) = `(x - 2)/(x - 3)` ∀ x ∈ A . Then show that f is bijective.
Let f : R → R, g : R → R be two functions such that f(x) = 2x – 3, g(x) = x3 + 5. The function (fog)-1 (x) is equal to ____________.
A function f: x → y is/are called onto (or surjective) if x under f.
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Let S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f: S `rightarrow` S such that f(m.n) = f(m).f(n) for every m, n ∈ S and m.n ∈ S is equal to ______.
ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.
REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.
A function is called many-one if two or more different elements of the domain have:
A function is called into if:
