Advertisements
Advertisements
प्रश्न
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)}
Advertisements
उत्तर
S = {a, b, c}, T = {1, 2, 3}
F: S → T is defined as:
F = {(a, 3), (b, 2), (c, 1)}
⇒ F (a) = 3, F (b) = 2, F(c) = 1
Therefore, F−1: T → S is given by
F−1 = {(3, a), (2, b), (1, c)}.
संबंधित प्रश्न
Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is bijective function.
Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f(x) = `((x - 2)/(x - 3))`. Is f one-one and onto? Justify your answer.
Show that the function f : R → R given by f(x) = x3 is injective.
Which of the following functions from A to B are one-one and onto?
f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
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 .`
Let f : N → N be defined by
`f(n) = { (n+ 1, if n is odd),( n-1 , if n is even):}`
Show that f is a bijection.
[CBSE 2012, NCERT]
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 8x3 and g(x) = x1/3.
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Let f, g, h be real functions given by f(x) = sin x, g (x) = 2x and h (x) = cos x. Prove that fog = go (fh).
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
` if f : (-π/2 , π/2)` → R and g : [−1, 1]→ R be defined as f(x) = tan x and g(x) = `sqrt(1 - x^2)` respectively, describe fog and gof.
Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
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 : 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, 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]
If the mapping f : {1, 3, 4} → {1, 2, 5} and g : {1, 2, 5} → {1, 3}, given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then write fog. [NCERT EXEMPLAR]
\[f : R \to R \text{given by} f\left( x \right) = x + \sqrt{x^2} \text{ is }\]
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}\]
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\]
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f is
If \[F : [1, \infty ) \to [2, \infty )\] is given by
\[f\left( x \right) = x + \frac{1}{x}, then f^{- 1} \left( x \right)\]
The number of bijective functions from set A to itself when A contains 106 elements is ____________.
The function f : R → R given by f(x) = x3 – 1 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?
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let f: R → R be defined by f(x) = x − 4. Then the range of f(x) is ____________.
'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:
Consider a set containing function A= {cos–1cosx, sin(sin–1x), sinx((sinx)2 – 1), etan{x}, `e^(|cosx| + |sinx|)`, sin(tan(cosx)), sin(tanx)}. B, C, D, are subsets of A, such that B contains periodic functions, C contains even functions, D contains odd functions then the value of n(B ∩ C) + n(B ∩ D) is ______ where {.} denotes the fractional part of functions)
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 ______.
Let A = {1, 2, 3, ..., 10} and f : A `rightarrow` A be defined as
f(k) = `{{:(k + 1, if k "is odd"),( k, if k "is even"):}`.
Then the number of possible functions g : A `rightarrow` A such that gof = f 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.
Which one of the following graphs is a function of x?
 |
 |
| Graph A | Graph B |
If f : R `rightarrow` R is defined by `f(x) = (2x - 7)/4`, show that f(x) is one-one and onto.
In the function from \(X\) to \(Y\), if \(6\in Y\) is not the image of any element of \(X\), the function is:
