Advertisements
Advertisements
प्रश्न
If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1(24) and f−1 (5).
Advertisements
उत्तर
Injectivity of f :
Let x and y be two elements in domain (R),
such that, x3 − 3 = y3 − 3
⇒ x3 = y3
⇒ x = y
So, f is one-one.
Surjectivity of f :
Let y be in the co-domain (R) such that f(x) = y
⇒ x3 - 3 = y
⇒ x3 = y + 3
⇒ `x = 3sqrt(y+3) in R`
⇒ f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Let f−1(x) = y ...(1)
⇒ x= f( y)
⇒ x = y3−3
⇒ x + 3 = y3
⇒ `y = 3sqrt(x+3) = f^-1 (x)` [from (1)]
`So, f^-1 (x) = 3sqrt(x+3)`
Now`, f^1 (24) = 3sqrt(24+3) = 3sqrt27 = 3sqrt3^3 =3`
and `f^-1 (5) = 3sqrt(5+3) = 3 sqrt8 = 3sqrt2^3 =2`
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : Z → Z given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : Q − {3} → Q, defined by `f (x) = (2x +3)/(x-3)`
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
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.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x and g(x) = |x| .
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.
Find fog and gof if : f(x) = c, c ∈ R, g(x) = sin `x^2`
State with reason whether the following functions have inverse :
f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}
A function f : R → R is defined as f(x) = x3 + 4. Is it a bijection or not? In case it is a bijection, find f−1 (3).
If f : A → A, g : A → A are two bijections, then prove that fog is a surjection ?
If f : R → R is given by f(x) = x3, write f−1 (1).
If f : R → R, g : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
Write the domain of the real function
`f (x) = sqrt([x] - x) .`
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
If \[g \left( f \left( x \right) \right) = \left| \sin x \right| \text{and} f \left( g \left( x \right) \right) = \left( \sin \sqrt{x} \right)^2 , \text{then}\]
The inverse of the function
\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by
\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is
Let
\[A = \left\{ x \in R : x \leq 1 \right\} and f : A \to A\] be defined as
\[f\left( x \right) = x \left( 2 - x \right)\] Then,
\[f^{- 1} \left( x \right)\] is
Let \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]
Write about strcmp() function.
Let N be the set of natural numbers and the function f: N → N be defined by f(n) = 2n + 3 ∀ n ∈ N. Then f is ______.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(x, y): x is a person, y is the mother of x}
Let C be the set of complex numbers. Prove that the mapping f: C → R given by f(z) = |z|, ∀ z ∈ C, is neither one-one nor onto.
Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.
Let f : R → R be a function defined by f(x) `= ("e"^abs"x" - "e"^-"x")/("e"^"x" + "e"^-"x")` then f(x) is
The function f: R → R defined as f(x) = x3 is:
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
If f: R → R given by f(x) =(3 − x3)1/3, find f0f(x)
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Consider a function f: `[0, pi/2] ->` R, given by f(x) = sinx and `g[0, pi/2] ->` R given by g(x) = cosx then f and g are
Let f: R→R be defined as f(x) = 2x – 1 and g: R – {1}→R be defined as g(x) = `(x - 1/2)/(x - 1)`. Then the composition function f (g(x)) is ______.
If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n" "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' 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 ______.
For x ∈ R, x ≠ 0, let f0(x) = `1/(1 - x)` and fn+1 (x) = f0(fn(x)), n = 0, 1, 2, .... Then the value of `f_100(3) + f_1(2/3) + f_2(3/2)` 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.
