Let . The number of one-one functions such that , , and is :
To solve for the number of one-one functions , we need to satisfy three specific conditions while ensuring no two elements in map to the same image.
Since , the values for and must be distinct elements from the set . The pairs that sum to 5 are:
All four cases above satisfy . Now we calculate the number of choices for for each case, keeping in mind that is a one-one function (so cannot equal or ).
Case |
f(2) |
f(3) |
Possible values for f(1)∈{3,4,5,6} |
No. of choices for f(1) |
1 |
1 |
4 |
(excluding 4) |
3 |
2 |
4 |
1 |
(excluding 4) |
3 |
3 |
2 |
3 |
(excluding 3) |
3 |
4 |
3 |
2 |
(excluding 3) |
3 |
Total ways to assign :
ways.
For each of the 12 ways identified above, we have 3 elements left in the domain and 3 elements remaining in the codomain. Since the function is one-one, these 3 elements can be mapped in ways.
Total number of one-one functions = (Ways to pick ) (Ways to arrange remaining elements)
Final Answer: 72
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.