Let denote the set of all positive integers. Consider the sets
and .
Let be the set of all functions such that and . Consider the set
.
Then the number of elements in the set is ___________.
The condition for all forces to be one-one on , because distinct values give distinct outputs , which would require distinct .
Conversely, any injective admits such a (define on the image of via and arbitrarily elsewhere into ). So is the set of injective with and .
Total injective functions from to : .
Use inclusion-exclusion on the forbidden sets and .
(fix , then choose an injection from the remaining 4 elements of to the remaining 6 elements of ) . By symmetry .
(fix , inject the remaining 3 elements of into the remaining 5 of ) .
.
Practice more MATH-III
Concept-wise practice with instant solutions on Fundamenthol.
Start practicing →