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.
Step 1: Writing c=f(1), the recurrence gives f(n)=nc for n in N; since c is positive, f is one-to-one.
Step 2: If f is onto N, its positive integer multiples must include 1, so c=1 and f(n)=n. Thus statement C is true.
Step 3: If f∁g is one-to-one and g(u)=g(v), then f(g(u))=f(g(v)) implies u=v; statement D is true.
Step 4: Statement A is false: take f(n)=n and an onto, non-one-to-one g, for example g(n)=max(1,n-1). Then f∁g=g is not one-to-one. Hence option A.
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.