Advertisements
Advertisements
प्रश्न
Find fog and gof if : f (x) = ex g(x) = loge x .
Advertisements
उत्तर
f (x)=ex, g(x) = loge x
f : R → ( 0, ∞); g : ( 0, ∞) → R
Computing fog:
Clearly, the range of g is a subset of the domain of f.
fog : ( 0, ∞) → R
(fog) (x) = f (g (x))
= f (loge x)
= loge ex
= x
Computing gof:
Clearly, the range of f is a subset of the domain of g .
⇒ fog : R→ R
(gof) (x) = g (f (x))\
= g (ex)
= loge ex
= x
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : Z → Z given by f(x) = x3
Show that the Signum Function f : R → R, given by `f(x) = {(1", if" x > 0), (0", if" x = 0), (-1", if" x < 0):}` is neither one-one nor onto.
Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is a bijective function.
Let f : N → N be defined by f(n) = `{((n+1)/2", if n is odd"),(n/2", if n is even"):}` for all n ∈ N.
State whether the function f is bijective. Justify your answer.
Show that the function f : R → {x ∈ R : −1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.
Classify the following function as injection, surjection or bijection : f : Z → Z given by f(x) = x2
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
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 .
If f : A → B and g : B → C are onto functions, show that gof is a onto function.
Let f be a real function given by f (x)=`sqrt (x-2)`
Find each of the following:
(i) fof
(ii) fofof
(iii) (fofof) (38)
(iv) f2
Also, show that fof ≠ `f^2` .
State with reason whether the following functions have inverse:
h : {2, 3, 4, 5} → {7, 9, 11, 13} with h = {(2, 7), (3, 9), (4, 11), (5, 13)}
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.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
If f : R → R defined by f(x) = 3x − 4 is invertible, then write f−1 (x).
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
The function f : R → R defined by
`f (x) = 2^x + 2^(|x|)` is
The range of the function
\[f\left( x \right) =^{7 - x} P_{x - 3}\]
Let \[f\left( x \right) = x^2 and g\left( x \right) = 2^x\] Then, the solution set of the equation
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 R be the set of real numbers and f: R → R be the function defined by f(x) = 4x + 5. Show that f is invertible and find f–1.
For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is injective. Then both f and g are injective functions.
For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.
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)}
Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto
Let f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.
If f(x) = (4 – (x – 7)3}, then f–1(x) = ______.
The smallest integer function f(x) = [x] is ____________.
The number of bijective functions from set A to itself when A contains 106 elements is ____________.
Let f : R `->` R be a function defined by f(x) = x3 + 4, then f is ______.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wants to know among those relations, how many functions can be formed from B to G?
A function f: x → y is said to be one – one (or injective) if:
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Let a and b are two positive integers such that b ≠ 1. Let g(a, b) = Number of lattice points inside the quadrilateral formed by lines x = 0, y = 0, x = b and y = a. f(a, b) = `[a/b] + [(2a)/b] + ... + [((b - 1)a)/b]`, then the value of `[(g(101, 37))/(f(101, 37))]` is ______.
(Note P(x, y) is lattice point if x, y ∈ I)
(where [.] denotes greatest integer function)
Let f(1, 3) `rightarrow` R be a function defined by f(x) = `(x[x])/(1 + x^2)`, where [x] denotes the greatest integer ≤ x, Then the range of f is ______.
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 ______.
