Advertisements
Advertisements
Question
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]
Advertisements
Solution
We have,
f : {1, 3, 4}
→ {1, 2, 5} and g : {1, 2, 5}
→ {1, 3}, are given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, respectively
As,
\[fog\left( 2 \right) = f\left( g\left( 2 \right) \right) = f\left( 3 \right) = 5, \]
\[fog\left( 5 \right) = f\left( g\left( 5 \right) \right) = f\left( 1 \right) = 2, \]
\[fog\left( 1 \right) = f\left( g\left( 1 \right) \right) = f\left( 3 \right) = 5, \]
\[So, \]
\[fog : \left\{ 1, 2, 5 \right\} \to \left\{ 1, 2, 5 \right\} \text{ is given by}\]
\[fog = \left\{ \left( 2, 5 \right), \left( 5, 2 \right), \left( 1, 5 \right) \right\}\]
APPEARS IN
RELATED QUESTIONS
Prove that the greatest integer function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.
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) = 3x. Choose the correct answer.
Show that the function f : R → {x ∈ R : –1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sinx
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 5x3 + 4
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = `x/(x^2 +1)`
Let A = [-1, 1]. Then, discuss whether the following functions from A to itself is one-one, onto or bijective : h(x) = x2
Set of ordered pair of a function ? If so, examine whether the mapping is injective or surjective :{(a, b) : a is a person, b is an ancestor of a}
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
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) = x+1, g(x) = `e^x`
.
Find fog and gof if : f(x)= x + 1, g (x) = 2x + 3 .
If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x|- x, ∀x∈R" .Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).
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.
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
Let `f : R - {- 3/5}` → R be a function defined as `f (x) = (2x)/(5x +3).`
f-1 : Range of f → `R -{-3/5}`.
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 : A → B defined by
f (x) = - x2 + 6x - 8 is a bijection if
Mark the correct alternative in the following question:
Let f : R \[-\] \[\left\{ \frac{3}{5} \right\}\] \[\to\] R be defined by f(x) = \[\frac{3x + 2}{5x - 3}\] Then,
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 X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
h = {(1,4), (2, 5), (3, 5)}
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
g(x) = |x|
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
If f(x) = (4 – (x – 7)3}, then f–1(x) = ______.
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Raji wants to know the number of functions from A to B. How many number of functions are possible?
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?
Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:
If f; R → R f(x) = 10x + 3 then f–1(x) is:
The domain of the function `cos^-1((2sin^-1(1/(4x^2-1)))/π)` 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.
Let \(X=\{-1,2,5,8,11\}\), \(Y=\{4,6,8\}\), and suppose different elements \(2,5,8\) of \(X\) have the same image \(4\). What type of function is it with respect to the one-one property?
In the function from \(X\) to \(Y\), if \(6\in Y\) is not the image of any element of \(X\), the function is:
Which real-life situation resembles a one-one idea when no roll number is repeated?
Many students choosing the same favourite subject resembles which type of function?
