View written solutionFree
Correct answer: 119
Step-by-step Solution:
1. Identify the given information: Let X be a set with 5 elements, so . Let Y be a set with 7 elements, so .
2. Calculate α, the number of one-one functions from X to Y. A one-one (injective) function from X to Y maps each element of X to a unique element in Y. To construct such a function, we choose images for the 5 elements of X from the 7 elements of Y without replacement.
- The first element of X can be mapped to any of the 7 elements in Y.
- The second element of X can be mapped to any of the remaining 6 elements in Y.
- The third element of X can be mapped to any of the remaining 5 elements in Y.
- The fourth element of X can be mapped to any of the remaining 4 elements in Y.
- The fifth element of X can be mapped to any of the remaining 3 elements in Y.
So, the total number of one-one functions, α, is the number of permutations of 7 items taken 5 at a time, denoted as .
3. Calculate β, the number of onto functions from Y to X. An onto (surjective) function from Y to X maps elements of Y to X such that every element in X is the image of at least one element in Y. The domain is Y with elements, and the codomain is X with elements.
The number of onto functions from a set of size to a set of size is given by the formula using the principle of inclusion-exclusion: Here, and . Expanding the sum: Now, we calculate the values of the terms:
- ,
- ,
- ,
- ,
- ,
- ,
Substitute these values back into the expression for β:
4. Calculate the value of the expression . First, calculate : Next, calculate : Finally, substitute these values into the given expression: Performing the division:
Conclusion: The value of is 119.
More from Functions
- Let and (Here, the inverse…2018 · MCQ
- Let S = {1, 2, 3, .........., 9}. For k = 1, 2, .........., 5, let Nk be the number of subsets of S, each containing five elements out of which exactly k are odd. Then N1 + N2 + N3 + N4 + N5 =2017 · MCQ
- Let for all and g(x) = for all x R. Let denote f(g(x)) and denote g(f(x)).…2015 · Multiple correct
- For every pair of continuous function f, g : [0, 1] R such that max {f(x) : x [0, 1]} = max {g(x) : x [0, 1]}. The correct statement(s) is (are)2014 · Multiple correct
- Let be given by . Then,2014 · Multiple correct
- Let f1 : R R, f2 : [0, ) R, f3 : R R, and f4 : R [0, ) be defined by … Includes diagram2014 · MCQ
- The function , defined by , is2012 · MCQ
- Let be such that for . Then the value(s) of …2012 · Multiple correct