Functions
The number of onto functions from a set A containing m elements to a set B containing n elements (m ≥ n) is
Select the correct option:
Solution
n! S(m,n)
- Combinatorial Logic: An onto function requires every element in B to have at least one pre-image.
- Stirling Numbers: S(m,n) represents the number of ways to partition a set of m elements into n non-empty, unlabelled subsets.
- Permutation: Since the n elements in the codomain are distinct (labelled), we multiply the partitions by n! to assign them to specific codomain elements.
- Formula: Total onto functions = n!×S(m,n).
- This can also be solved using the Principle of Inclusion-Exclusion.
🔒 Solution Hidden from View
Submit your answer to unlock the detailed step-by-step solution.
More functions Practice Questions
Given f(x)=x1/x for x>0. The maximum value of f(x) is:
Given f(x)=x1/x for x>0. The maximum value of f(x) is:
The range of cos⁻¹(x) is
The range of cos⁻¹(x) is
The range of sin⁻¹(x) is
The range of sin⁻¹(x) is
If f: [0, ∞) → [0, ∞) is defined by f(x) = x/(1 + x), then f is
If f: [0, ∞) → [0, ∞) is defined by f(x) = x/(1 + x), then f is
If f: R → R is defined by f(x) = 2x + 3 and g: R → R is defined by g(x) = x² + 1, then (gof)⁻¹(10) e...
If f: R → R is defined by f(x) = 2x + 3 and g: R → R is defined by g(x) = x² + 1, then (gof)⁻¹(10) e...
About This Question
- Subject
- mathematics
- Chapter
- sets, relations and functions
- Topic
- functions
- Difficulty
- Hard
- Year
- 2025
Solution
Correct Answer:
n! S(m,n)
- Combinatorial Logic: An onto function requires every element in B to have at least one pre-image.
- Stirling Numbers: S(m,n) represents the number of ways to partition a set of m elements into n non-empty, unlabelled subsets.
- Permutation: Since the n elements in the codomain are distinct (labelled), we multiply the partitions by n! to assign them to specific codomain elements.
- Formula: Total onto functions = n!×S(m,n).
- This can also be solved using the Principle of Inclusion-Exclusion.
This hard difficulty mathematics question is from the chapter sets, relations and functions, covering the topic of functions. It appeared in the 2025 exam.
Looking for more practice? Explore all mathematics questions or browse sets, relations and functions questions on RankGuru.