Advertisements
Advertisements
Question
If A = {1, 2, 3} and B = {a, b}, write the total number of functions from A to B.
Advertisements
Solution
Formula:
If set A has m elements and set B has n elements, then the number of functions from A to B is
Given:
A = {1, 2, 3} and B = {a, b}
⇒ n (A) = 3 and n (B) = 2
∴ Number of functions from A to B = 23 = 8
APPEARS IN
RELATED QUESTIONS
Show that the signum function f : R → R, given by
`f(x) = {(1", if" x > 0), (0", if" x = 0), (-1", if" x < 0):}`
is neither one-one nor onto.
Give an example of a function which is neither one-one nor onto ?
If A = {1, 2, 3}, show that a onto function f : A → A must be one-one.
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x2 + 2x − 3 and g(x) = 3x − 4 .
Let A = {a, b, c}, B = {u v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Find fog and gof if : f(x) = sin−1 x, g(x) = x2
Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.
If f(x) = sin x and g(x) = 2x be two real functions, then describe gof and fog. Are these equal functions?
State with reason whether the following functions have inverse :
g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 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
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
If f : R → R is defined by f(x) = x2, write f−1 (25)
Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (x).
Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write the total number of onto functions from A to B.
The function
If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\]
Let
\[A = \left\{ x \in R : x \geq 1 \right\}\] The inverse of the function,
\[f : A \to A\] given by
\[f\left( x \right) = 2^{x \left( x - 1 \right)} , is\]
Let \[f\left( x \right) = \frac{\alpha x}{x + 1}, x \neq - 1\] Then, for what value of α is \[f \left( f\left( x \right) \right) = x?\]
Let [x] denote the greatest integer less than or equal to x. If \[f\left( x \right) = \sin^{- 1} x, g\left( x \right) = \left[ x^2 \right]\text{ and } h\left( x \right) = 2x, \frac{1}{2} \leq x \leq \frac{1}{\sqrt{2}}\]
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
A function f: R→ R defined by f(x) = `(3x) /5 + 2`, x ∈ R. Show that f is one-one and onto. Hence find f−1.
Write about strlen() function.
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 A be a finite set. Then, each injective function from A into itself is not surjective.
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
k = {(1,4), (2, 5)}
Which of the following functions from Z into Z are bijections?
The mapping f : N → N is given by f(n) = 1 + n2, n ∈ N when N is the set of natural numbers is ____________.
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
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?
Let f: R → R defined by f(x) = 3x. Choose the correct answer
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.
If f: R→R is a function defined by f(x) = `[x - 1]cos((2x - 1)/2)π`, where [ ] denotes the greatest integer function, then f is ______.
Let f: R→R be a continuous function such that f(x) + f(x + 1) = 2, for all x ∈ R. If I1 = `int_0^8f(x)dx` and I2 = `int_(-1)^3f(x)dx`, then the value of I1 + 2I2 is equal to ______.
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 of degree 3 such that f(k) = `-2/k` for k = 2, 3, 4, 5. Then the value of 52 – 10f(10) is equal to ______.
Which condition represents a one-one (injective) function?
