Advertisements
Advertisements
प्रश्न
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.
उत्तर
A = R − {3}, B = R − {1}
f: A → B is defined as `f(x) = ((x -2)/(x -3))`
Let x, y ∈ A such that f(x) = f(y)
`=> (x -2)/(x - 3) = (y - 2)/(y - 3)`
=> (x - 2) (y - 3) = (y -2) (x - 3)
`=> xy - 3x - 2y + 6 = xy - 3y - 2x + 6`
`= > -3x - 2y = -3y -2x`
=> 3x - 2x = 3y - 2y
=> x = y
∴ f is one - one.
Let y ∈B = R − {1}. Then, y ≠ 1.
The function f is onto if there exists x ∈A such that f(x) = y.
f(x)= y
`=>(x -2)/(x - 3) = y`
`=> x - 2 = xy - 3y`
`=> x(1- y) = -3y + 2`
`=> x = (2-3y) / (1- y) in A` [`y != 1`]
Thus, for any y ∈ B, there exists `(2 - 3y)/(1 - y) in A` such that
`f(2 - 3y)/(1- y)= (((2-3y)/(1-y)) -2)/(((2-3y)/(1-y)) - 3)`
`= (2-3y - 2 + 2y)/(2-3y - 3 + 3y)`
`= (-y)/(-1)`
Hence, function f is one - one and onto.
APPEARS IN
संबंधित प्रश्न
Let f: N → N be defined by f(n) = `{((n+1)/2, ",if n is odd"),(n/2,",n is even"):}` for all n ∈ N.
State whether the function f is bijective. Justify your answer.
Show that function f: R `rightarrow` {x ∈ R : −1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.
Given examples of two functions f: N → N and g: N → N such that gof is onto but f is not onto.
(Hint: Consider f(x) = x + 1 and `g(x) = {(x-1, ifx >1),(1, if x = 1):}`
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 : Z → Z given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = `x/(x^2 +1)`
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 = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}. Show that gof is defined while fog is not defined. Also, find gof.
Find fog and gof if : f(x) = c, c ∈ R, g(x) = sin `x^2`
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
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Let f : R `{- 4/3} `- 43 →">→ R be a function defined as f(x) = `(4x)/(3x +4)` . Show that f : R - `{-4/3}`→ Rang (f) is one-one and onto. Hence, find f -1.
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 A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
Let C denote the set of all complex numbers. A function f : C → C is defined by f(x) = x3. Write f−1(1).
Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (x).
Let f : R → R be defined as `f (x) = (2x - 3)/4.` write fo f-1 (1) .
If f : R → R be defined by f(x) = (3 − x3)1/3, then find fof (x).
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
Let
\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is
Let
\[f : R \to R\] be a function defined by
A function f from the set of natural numbers to the set of integers defined by
\[f\left( n \right)\begin{cases}\frac{n - 1}{2}, & \text{when n is odd} \\ - \frac{n}{2}, & \text{when n is even}\end{cases}\]
Mark the correct alternative in the following question:
Let f : R → R be given by f(x) = tanx. Then, f-1(1) is
Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is
Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is
If f(x) = `(x+3)/(4x−5) , "g"(x) = (3+5x)/(4x−1)` then verify that `("fog") (x)` = x.
If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))
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 ____________.
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.
- Let R: B → G be defined by R = { (b1,g1), (b2,g2),(b3,g1)}, then R is ____________.
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 ____________.
Let f: R → R defined by f(x) = x4. Choose the correct answer
A function f: x → y is said to be one – one (or injective) if:
A function f: x → y is/are called onto (or surjective) if x under f.
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.
