Advertisements
Advertisements
प्रश्न
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
Advertisements
उत्तर
f (f (x)) = f (3x +2)
= 3 (3x +2) +2
= 9x + 6 + 2
= 9x + 8
APPEARS IN
संबंधित प्रश्न
Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but gis not injective.
(Hint: Consider f(x) = x and g(x) =|x|)
Give an example of a function which is neither one-one nor onto ?
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 5x3 + 4
Show that the exponential function f : R → R, given by f(x) = ex, is one-one but not onto. What happens if the co-domain is replaced by`R0^+` (set of all positive real numbers)?
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 + 3 and g(x) = x2 + 5 .
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 .
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 one-one functions, show that gof is a one-one 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)}
If f : Q → Q, g : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −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]
If f : R → (−1, 1) defined by `f (x) = (10^x- 10^-x)/(10^x + 10 ^-x)` is invertible, find f−1.
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.
If f : R → R defined by f(x) = 3x − 4 is invertible, 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.
Let f be an invertible real function. Write ( f-1 of ) (1) + ( f-1 of ) (2) +..... +( f-1 of ) (100 )
If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).
Let f : R → R be the function defined by f(x) = 4x − 3 for all x ∈ R Then write f . [NCERT EXEMPLAR]
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]
\[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, 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
Write about strlen() function.
Let f: R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are ______.
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
g = {(1, 4), (2, 4), (3, 4)}
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 – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, is ____________.
The domain of the function `"f"("x") = 1/(sqrt ({"sin x"} + {"sin" ( pi + "x")}))` where {.} denotes fractional part, 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 find the number of injective functions from B to G. How many numbers of injective functions are possible?
If f; R → R f(x) = 10x + 3 then f–1(x) is:
If f: R→R is a function defined by f(x) = `[x - 1]cos((2x - 1)/2)π`, where [ ] denotes the greatest integer function, then f is ______.
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.
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:
For \(f(x)=x^2+x\), if \(y=1\), which two domain elements have the same image?
Which real-life situation resembles a one-one idea when no roll number is repeated?
A perfect one-to-one matching between users and unique IDs is similar to:
