The number of bijective functions if is
We wish to count bijective functions satisfying the strict inequality
Both the domain and the codomain consist of 50 elements, namely and respectively. Since is bijective, every one of the 50 codomain values must be used exactly once.
The requirement that the values assigned to the 49 inputs form a strictly decreasing sequence implies that once we choose which 49 codomain values fill those inputs, there is exactly one way to order them so that The remaining input, 1, can be mapped to any of the 50 codomain values; choosing its image then determines exactly which 49 values remain for the decreasing chain.
Therefore, the total number of such bijections is simply the number of choices for , namely:
The answer is Option A.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.