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.
Let $$f, g: \mathbb{N}-\{1\} \rightarrow \mathbb{N}$$ be functions defined by $$f(a)=\alpha$$, where $$\alpha$$ is the maximum of the powers of those primes $$p$$ such that $$p^{\alpha}$$ divides $$a$$, and $$g(a)=a+1$$, for all $$a \in \mathbb{N}-\{1\}$$. Then, the function $$f+g$$ is
Step 1: For a≥2, (f+g)(a)=a+1+f(a), where f(a) is the greatest exponent in the prime factorization of a.
Step 2: (f+g)(4)=4+1+2=7 and (f+g)(5)=5+1+1=7, so the function is not one-one.
Step 3: Its least possible value is (f+g)(2)=4; hence 1, 2 and 3 are not in its range. Thus it is neither one-one nor onto, option D.
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.