Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
The number of bijective functions $$f:\{1,3,5,7, \ldots, 99\} \rightarrow\{2,4,6,8, \ldots .100\}$$, such that $$f(3) \geq f(9) \geq f(15) \geq f(21) \geq \ldots . . f(99)$$, is ____________.
Step 1: The constrained domain elements are 3,9,15,…,99, a set of 17 elements.
Step 2: Choose their 17 distinct images from the 50 codomain elements in C(50,17) ways; their required decreasing order is then forced.
Step 3: Bijection of the remaining 33 elements is arbitrary, giving C(50,17)·33!=50P33, option B.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.