Not Quite Fibonacci

Number Theory Level 3

Let us define a recursive relation of MnM_n as follows:

{M1=1M2=2Mn=Mn−1Mn−2 for n>2\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(M17)\log_2({M_{17}})?

Geoff Pilling by Geoff Pilling
×

Problem Loading...

Note Loading...

Set Loading...