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: On each block {3n+1,3n+2,3n+3}, g is the cycle 3n+1→3n+2→3n+3→3n+1. Thus g³ is the identity, not g.
Step 2: An injective f with f∘g=f cannot exist, because f(g(x))=f(x) would imply g(x)=x, contrary to the three-cycles. No f can satisfy g∘f=f because g has no fixed point.
Step 3: Define f(3n+1)=f(3n+2)=f(3n+3)=n+1. This f is onto N and satisfies f∘g=f, so option A is true.
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.