Working backwards through a recursive rule

Working backwards through a recursive rule

Junior College 2
8 marks

The function \(\mathrm{g}\), with domain the non-negative integers, is defined by

\[\mathrm{g}(n)=\begin{cases}1,&n=0,\\2\mathrm{g}\left(\dfrac n2\right),&n\text{ is positive and even},\\1+\mathrm{g}\left(\dfrac{n-1}{2}\right),&n\text{ is odd}.\end{cases}\]

  1. Find \(\mathrm{g}(7)\), \(\mathrm{g}(10)\) and \(\mathrm{g}(12)\).[3]
  2. Find all values of \(n\) for which \(\mathrm{g}(n)=4\), showing your reasoning.[3]
  3. Hence explain why \(\mathrm{g}\) does not have an inverse.[2]

Video Solution:

Video Solution

Video solution locked

Solution:

Solution locked

Sign in to view the step-by-step solution

Similar questions are unavailable for this question.
Answer:(a) \(4,10,12\) (b) \(n=2\) or \(n=7\). (c) \(\mathrm{g}(2)=\mathrm{g}(7)=4\), so \(\mathrm{g}\) is not one-to-one.

Need help? Join our JC Math tuition classes.

Learn more