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 one-one functions f : {a, b, c, d} $$\to$$ {0, 1, 2, ......, 10} such
that 2f(a) $$-$$ f(b) + 3f(c) + f(d) = 0 is ___________.
Step 1: Put A=f(a), B=f(b), C=f(c), D=f(d). The constraint is B=2A+3C+D, with A,B,C,D distinct members of {0,1,…,10}.
Step 2: For each ordered distinct pair (A,C), count the admissible D distinct from A,C for which B=2A+3C+D lies in {0,…,10} and differs from A,C,D.
Step 3: Summing these finite admissible cases gives 31 ordered quadruples (A,B,C,D), hence 31 one-one functions.
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.