Advertisements
Advertisements
प्रश्न
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).
Advertisements
उत्तर
Injectivity of f:
Let x and y be two elements of domain (R), such that
f (x) = f (y)
⇒ x3 + 4 = y3 + 4
⇒ 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.
⇒ x2 + 4 = y
⇒ x3 = y - 4
⇒ `x = 3sqrt( y-4) in R` (domain)
⇒ f is onto.
So, f is a bijection and, hence, is invertible.
Finding f -1:
Let f−1 (x) = y ...(1)
⇒ x = f (y)
⇒ x = y3+ 4
⇒ x − 4 = y3
⇒ `y = 3sqrt(x-4)`
So, f−1(x) = `3sqrt(x-4)` [from (1)]
`f^-1(3) = 3sqrt(3-4) = 3sqrt-1 = -1`
APPEARS IN
संबंधित प्रश्न
Show that the modulus function f : R → R, given by f(x) = |x|, is neither one-one nor onto, where |x| is x, if x is positive or 0 and |x| is –x, if x is negative.
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.
Let f : R → R be defined as f(x) = x4. Choose the correct answer.
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x2
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 1 + x2
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 8 and g(x) = 3x3 + 1 .
Give examples of two functions f : N → N and g : N → N, such that gof is onto but f is not onto.
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Let A = {x &epsis; R | −1 ≤ x ≤ 1} and let f : A → A, g : A → A be two functions defined by f(x) = x2 and g(x) = sin (π x/2). Show that g−1 exists but f−1 does not exist. Also, find g−1.
Which of the following graphs represents a one-one function?
If f : R → R is defined by f(x) = x2, write f−1 (25)
Let f, g : R → R be defined by f(x) = 2x + l and g(x) = x2−2 for all x
∈ R, respectively. Then, find gof. [NCERT EXEMPLAR]
The function
\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
Let
\[f : R - \left\{ n \right\} \to R\]
Let
\[A = \left\{ x \in R : x \geq 1 \right\}\] The inverse of the function,
\[f : A \to A\] given by
\[f\left( x \right) = 2^{x \left( x - 1 \right)} , is\]
If \[f\left( x \right) = \sin^2 x\] and the composite function \[g\left( f\left( x \right) \right) = \left| \sin x \right|\] then g(x) is equal to
A function f: R→ R defined by f(x) = `(3x) /5 + 2`, x ∈ R. Show that f is one-one and onto. Hence find f−1.
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
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.
Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.
Let f: R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are ______.
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.
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 A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
h(x) = x|x|
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
The smallest integer function f(x) = [x] is ____________.
Let A = R – {3}, B = R – {1}. Let f : A → B be defined by `"f"("x") = ("x" - 2)/("x" - 3)` Then, ____________.
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers is ____________.
If f: R → R given by f(x) =(3 − x3)1/3, find f0f(x)
A function f: x → y is said to be one – one (or injective) if:
Number of integral values of x satisfying the inequality `(3/4)^(6x + 10 - x^2) < 27/64` is ______.
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)
If A = {x ∈ R: |x – 2| > 1}, B = `{x ∈ R : sqrt(x^2 - 3) > 1}`, C = {x ∈ R : |x – 4| ≥ 2} and Z is the set of all integers, then the number of subsets of the set (A ∩ B ∩ C) C ∩ Z is ______.
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 ______.
Let f(x) be a polynomial function of degree 6 such that `d/dx (f(x))` = (x – 1)3 (x – 3)2, then
Assertion (A): f(x) has a minimum at x = 1.
Reason (R): When `d/dx (f(x)) < 0, ∀ x ∈ (a - h, a)` and `d/dx (f(x)) > 0, ∀ x ∈ (a, a + h)`; where 'h' is an infinitesimally small positive quantity, then f(x) has a minimum at x = a, provided f(x) is continuous at x = a.
A function is called many-one if two or more different elements of the domain have:
A function is onto when every element of the codomain has:
Which condition represents a many-one function?
