Number Of Functions
The total number of functions that can be defined from a set with 5 elements to a set with 3 elements, with no further restriction, equals which value?
Select the correct option:
Solution
243
A function assigns to each domain element exactly one codomain element, and these choices are independent, a counting principle central to JEE Advanced. Each of the 5 domain elements can be mapped to any of the 3 codomain elements, giving 3 choices per element. By the multiplication principle, the total number of functions is 3^5 = 243. The exponent is the domain size and the base is the codomain size, the canonical form (codomain)^(domain). Option 125 = 5^3 reverses base and exponent. Option 15 = 5·3 wrongly adds choices instead of multiplying. Option 8 confuses this with a subset count of a 3-set. Hence the total is 3^5 = 243. Plausibility check: the count must exceed the number of injective functions, which is zero here since the domain is larger than the codomain so no injection exists, and 243 comfortably accommodates all mappings including many non-injective ones, confirming the formula.
🔒 Solution Hidden from View
Submit your answer to unlock the detailed step-by-step solution.
About This Question
- Subject
- mathematics
- Chapter
- sets, relations and functions
- Topic
- number of functions
- Difficulty
- Easy
- Year
- 2025
Solution
Correct Answer:
243
A function assigns to each domain element exactly one codomain element, and these choices are independent, a counting principle central to JEE Advanced. Each of the 5 domain elements can be mapped to any of the 3 codomain elements, giving 3 choices per element. By the multiplication principle, the total number of functions is 3^5 = 243. The exponent is the domain size and the base is the codomain size, the canonical form (codomain)^(domain). Option 125 = 5^3 reverses base and exponent. Option 15 = 5·3 wrongly adds choices instead of multiplying. Option 8 confuses this with a subset count of a 3-set. Hence the total is 3^5 = 243. Plausibility check: the count must exceed the number of injective functions, which is zero here since the domain is larger than the codomain so no injection exists, and 243 comfortably accommodates all mappings including many non-injective ones, confirming the formula.
This easy difficulty mathematics question is from the chapter sets, relations and functions, covering the topic of number 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.