Evaluating a recursive rule and its powers-of-two inputs

Evaluating a recursive rule and its powers-of-two inputs

Junior College 2
7 marks

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

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

  1. Find \(\mathrm{f}(6)\), \(\mathrm{f}(11)\) and \(\mathrm{f}(20)\).[3]
  2. Does \(\mathrm{f}\) have an inverse? Justify your answer.[2]
  3. Find an expression for \(\mathrm{f}(2^m)\) in terms of \(m\), where \(m\) is a non-negative integer.[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) \(10,14,16\) (b) No; \(\mathrm{f}(5)=\mathrm{f}(6)=10\). (c) \(\mathrm{f}(2^m)=3m+3\).

Need help? Join our JC Math tuition classes.

Learn more