Not Quite Fibonacci
Number Theory
Level
2
Let us define a recursive relation of \(M_n\) as follows:
\[\begin{cases} M_1 = 1 \\ M_2 = 2 \\ M_n = M_{n-1} M_{n-2}\text{ for }n>2 \end{cases}\]
What is \(\log_2({M_{17}})\)?
by
Geoff Pilling