Advertisements
Advertisements
Question
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
Advertisements
Solution
Given that f(x) = 4x – 3 = y (say), then
4x = y + 3
⇒ x = `(y + 3)/4`
Hence f–1(y) = `(y + 3)/4`
⇒ f–1(x) = `(x + 3)/4`
APPEARS IN
RELATED QUESTIONS
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.
F = {(a, 3), (b, 2), (c, 1)}
Give an example of a function which is one-one but not onto ?
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sin2x + cos2x
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
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 .`
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + x2 and g(x) = x3
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 8 and g(x) = 3x3 + 1 .
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 8x3 and g(x) = x1/3.
Let f = {(3, 1), (9, 3), (12, 4)} and g = {(1, 3), (3, 3) (4, 9) (5, 9)}. Show that gof and fog are both defined. Also, find fog and gof.
If f : A → B and g : B → C are onto functions, show that gof is a onto function.
State with reason whether the following functions have inverse :
g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 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)}
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).
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).
Let A = {x ∈ R : −4 ≤ x ≤ 4 and x ≠ 0} and f : A → R be defined by \[f\left( x \right) = \frac{\left| x \right|}{x}\]Write the range of f.
Write whether f : R → R, given by `f(x) = x + sqrtx^2` is one-one, many-one, onto or into.
If f : R → R be defined by f(x) = (3 − x3)1/3, then find fof (x).
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]
Let A = {a, b, c, d} and f : A → A be given by f = {( a,b ),( b , d ),( c , a ) , ( d , c )} write `f^-1`. [NCERT EXEMPLAR]
\[f : R \to R \text{given by} f\left( x \right) = x + \sqrt{x^2} \text{ is }\]
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
Mark the correct alternative in the following question:
Let f : R → R be given by f(x) = tanx. Then, f-1(1) is
If f(x) = `(x+3)/(4x−5) , "g"(x) = (3+5x)/(4x−1)` then verify that `("fog") (x)` = x.
Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.
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 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.
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, ____________.
Let f: R → R defined by f(x) = x4. Choose the correct answer
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if "n is even"):}` Is the function injective? Justify your answer.
Let [x] denote the greatest integer ≤ x, where x ∈ R. If the domain of the real valued function f(x) = `sqrt((|[x]| - 2)/(|[x]| - 3)` is (–∞, a) ∪ [b, c) ∪ [4, ∞), a < b < c, then the value of a + b + c 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 ______.
A function is called into if:
A function is called bijective if it is both:
Many students choosing the same favourite subject resembles which type of function?
