Advertisements
Advertisements
Question
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is ______.
Options
720
120
0
none of these
Advertisements
Solution
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is 0.
Explanation:
Set A contains 5 elements and the set B contains 6 elements.
For one-one function each element in set B is assigned to only one element in set A.
Thus only '5' elements in set B are assigned to '5' elements of set 'A'
Thus range of function does not contain all '6' elements of set 'B'.
Thus if function is one-one it cannot be onto
APPEARS IN
RELATED QUESTIONS
In the following case, state whether the function is one-one, onto or bijective. Justify your answer.
f : R → R defined by f(x) = 1 + x2
Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is a bijective function.
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.
Which of the following functions from A to B are one-one and onto ?
f3 = {(a, x), (b, x), (c, z), (d, z)} ; A = {a, b, c, d,}, B = {x, y, z}.
Let A = {−1, 0, 1} and f = {(x, x2) : x ∈ A}. Show that f : A → A is neither one-one nor onto.
Classify the following function as injection, surjection or bijection : f : Z → Z given by f(x) = x2
Classify the following function as injection, surjection or bijection :
f : Q → Q, defined by f(x) = x3 + 1
Set of ordered pair of a function? If so, examine whether the mapping is injective or surjective :{(x, y) : x is a person, y is the mother of x}
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
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.
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).
State with reason whether the following functions have inverse :
f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}
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+ → [4, ∞) given by f(x) = x2 + 4. Show that f is invertible with inverse f−1 of f given by f−1 `(x)= sqrt (x-4)` where R+ is the set of all non-negative real numbers.
If f : R → R is given by f(x) = x3, write f−1 (1).
If f : C → C is defined by f(x) = x4, write f−1 (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 M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
The range of the function
\[f\left( x \right) =^{7 - x} P_{x - 3}\]
Let
\[A = \left\{ x : - 1 \leq x \leq 1 \right\} \text{and} f : A \to \text{A such that f}\left( x \right) = x|x|\]
If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =
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}\]
Let
\[f : [2, \infty ) \to X\] be defined by
\[f\left( x \right) = 4x - x^2\] Then, f is invertible if X =
If \[f : R \to \left( - 1, 1 \right)\] is defined by
\[f\left( x \right) = \frac{- x|x|}{1 + x^2}, \text{ then } f^{- 1} \left( x \right)\] equals
If \[g\left( x \right) = x^2 + x - 2\text{ and} \frac{1}{2} gof\left( x \right) = 2 x^2 - 5x + 2\] is equal to
If \[f : R \to R\] is given by \[f\left( x \right) = x^3 + 3, \text{then} f^{- 1} \left( x \right)\] is equal to
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 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be defined from A to B is ______.
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.
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f is ____________.
Let x is a real number such that are functions involved are well defined then the value of `lim_(t→0)[max{(sin^-1 x/3 + cos^-1 x/3)^2, min(x^2 + 4x + 7)}]((sin^-1t)/t)` where [.] is greatest integer function and all other brackets are usual brackets.
Let f(1, 3) `rightarrow` R be a function defined by f(x) = `(x[x])/(1 + x^2)`, where [x] denotes the greatest integer ≤ x, Then the range of f is ______.
Let a function `f: N rightarrow N` be defined by
f(n) = `{:[(2n",", n = 2"," 4"," 6"," 8","......),(n - 1",", n = 3"," 7"," 11"," 15","......),((n + 1)/2",", n = 1"," 5"," 9"," 13","......):}`
then 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.
