Advertisements
Advertisements
प्रश्न
Let f : R → R be defined as f(x) = 3x. Choose the correct answer.
विकल्प
f is one-one onto.
f is many-one onto.
f is one-one but not onto.
f is neither one-one nor onto.
Advertisements
उत्तर
f is one-one onto.
Explanation:
Let x1, x2 ∈ R such that f(x1) = f(x2)
⇒ 3x1 = 3x2
⇒ x1 = x2
∴ f is one-one.
Consider any y ∈ R (co-domain of f); there exist x ∈ R (domain of f) such that:
f(x) = y
⇒ 3x = y
⇒ x = `y/3`
∴ `f(y/3) = 3.y/3` = y
∴ f is onto.
Hence, f is one-one onto.
APPEARS IN
संबंधित प्रश्न
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.
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, 2), (b, 1), (c, 1)}
Let A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2} and f, g : A → B be functions defined by f(x) = x2 − x, x ∈ A and g(x) = `2|x - 1/2|- 1`, x ∈ A. Are f and g equal?
Justify your answer. (Hint: One may note that two functions f : A → B and g : A → B such that f(a) = g(a) ∀ a ∈ A are called equal functions.)
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 : R → R, defined by f(x) = x3 + 1
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 5x3 + 4
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.
Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.
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 : 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.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
If A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {a, b, c}.
Let \[f : \left[ - \frac{\pi}{2}, \frac{\pi}{2} \right] \to\] A be defined by f(x) = sin x. If f is a bijection, write set A.
Write the domain of the real function
`f (x) = sqrtx - [x] .`
Write whether f : R → R, given by `f(x) = x + sqrtx^2` is one-one, many-one, onto or into.
What is the range of the function
`f (x) = ([x - 1])/(x -1) ?`
\[f : A \to \text{B given by } 3^{ f\left( x \right)} + 2^{- x} = 4\] is a bijection, then
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
A function f from the set of natural numbers to integers defined by
`{([n-1]/2," when n is odd" is ),(-n/2,when n is even ) :}`
Let
\[f : R - \left\{ n \right\} \to R\]
\[f : R \to R\] is defined by
\[f\left( x \right) = \frac{e^{x^2} - e^{- x^2}}{e^{x^2 + e^{- x^2}}} is\]
If \[g \left( f \left( x \right) \right) = \left| \sin x \right| \text{and} f \left( g \left( x \right) \right) = \left( \sin \sqrt{x} \right)^2 , \text{then}\]
If \[f\left( x \right) = \sin^2 x\] and the composite function \[g\left( f\left( x \right) \right) = \left| \sin x \right|\] then g(x) is equal to
Mark the correct alternative in the following question:
Let f : R → R be given by f(x) = tanx. Then, f-1(1) is
Let N be the set of natural numbers and the function f: N → N be defined by f(n) = 2n + 3 ∀ n ∈ N. Then f is ______.
If N be the set of all-natural numbers, consider f: N → N such that f(x) = 2x, ∀ x ∈ N, then f is ____________.
Range of `"f"("x") = sqrt((1 - "cos x") sqrt ((1 - "cos x")sqrt ((1 - "cos x")....infty))`
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
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.
- The function f: R → R defined by f(x) = x − 4 is ____________.
If A = {x ∈ R: |x – 2| > 1}, B = `{x ∈ R : sqrt(x^2 - 3) > 1}`, C = {x ∈ R : |x – 4| ≥ 2} and Z is the set of all integers, then the number of subsets of the set (A ∩ B ∩ C) C ∩ Z is ______.
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.
ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.
REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.
