Advertisements
Advertisements
प्रश्न
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Advertisements
उत्तर
We know that every onto function from A to itself is one-one.
So, the number of one-one functions = number of bijections = n!
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x2
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.
Classify the following function as injection, surjection or bijection : f : Z → Z given by f(x) = x2
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 f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.
If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.
Find fog and gof if : f(x) = c, c ∈ R, g(x) = sin `x^2`
Let
f (x) =`{ (1 + x, 0≤ x ≤ 2) , (3 -x , 2 < x ≤ 3):}`
Find fof.
If f : R → (−1, 1) defined by `f (x) = (10^x- 10^-x)/(10^x + 10 ^-x)` is invertible, find f−1.
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
Let \[f : \left( - \frac{\pi}{2}, \frac{\pi}{2} \right) \to R\] be a function defined by f(x) = cos [x]. Write range (f).
If f : R → R defined by f(x) = 3x − 4 is invertible, then 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.
Let f : R → R be the function defined by f(x) = 4x − 3 for all x ∈ R Then write f . [NCERT EXEMPLAR]
Which one the following relations on A = {1, 2, 3} is a function?
f = {(1, 3), (2, 3), (3, 2)}, g = {(1, 2), (1, 3), (3, 1)} [NCERT EXEMPLAR]
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 → R be given by
\[f\left( x \right) = \left[ x^2 \right] + \left[ x + 1 \right] - 3\]
where [x] denotes the greatest integer less than or equal to x. Then, f(x) is
(d) one-one and onto
The function
\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
Which of the following functions from
\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\}\]
The inverse of the function
\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by
\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is
For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(a, b): a is a person, b is an ancestor of a}
The function f : A → B defined by f(x) = 4x + 7, x ∈ R is ____________.
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?
Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found that the swing traced the path of a Parabola as given by y = x2.
Answer the following questions using the above information.
- Let f: R → R be defined by f(x) = x2 is:
Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found that the swing traced the path of a Parabola as given by y = x2.
Answer the following questions using the above information.
- Let f: N → N be defined by f(x) = x2 is ____________.
Let f: R → R defined by f(x) = 3x. Choose the correct answer
A function f: x → y is said to be one – one (or injective) if:
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 ______.
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.
Consider a set containing function A= {cos–1cosx, sin(sin–1x), sinx((sinx)2 – 1), etan{x}, `e^(|cosx| + |sinx|)`, sin(tan(cosx)), sin(tanx)}. B, C, D, are subsets of A, such that B contains periodic functions, C contains even functions, D contains odd functions then the value of n(B ∩ C) + n(B ∩ D) is ______ where {.} denotes the fractional part of functions)
If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n" "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.
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 ______.
A function f : [– 4, 4] `rightarrow` [0, 4] is given by f(x) = `sqrt(16 - x^2)`. Show that f is an onto function but not a one-one function. Further, find all possible values of 'a' for which f(a) = `sqrt(7)`.
A function is called into if:
