Not Quite Fibonacci

Let us define a recursive relation of M n M_n as follows:

{ M 1 = 1 M 2 = 2 M n = M n 1 M n 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 ( M 17 ) \log_2({M_{17}}) ?


The answer is 987.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Geoff Pilling
Jun 21, 2017

Let L n = log 2 ( M n ) L_n = \log_2(M_n)

Since M n = M n 1 × M n 2 M_n = M_{n-1} \times M_{n-2} for n > 2 n>2 , this implies that:

L n = L n 1 + L n 2 L_n = L_{n-1} + L_{n-2} for n > 2 n>2

So, the L n L_n are simply the Fibonacci numbers, but they are off by 1. (Since Fibonacci numbers are defined F 0 = 0 , F 1 = 1 F_0 = 0, F_1 = 1 , and F 2 = 1 F_2 = 1 )

Or, L n = F n 1 L_n = F_{n-1} where F n F_n are the Fibonacci numbers!

So, log 2 ( M 17 ) = L 17 = F 16 = 987 \log_2(M_{17}) = L_{17} = F_{16} = \boxed{987}

Actually, the solution is F 16 F_{16} since Fibonacci numbers are numbered from 0 0 and the sequence listed is numbered from 1 1 .

Marta Reece - 3 years, 11 months ago

Log in to reply

Thanks! I've updated the solution, accordingly.

Geoff Pilling - 3 years, 11 months ago

nice problem !

Relue Tamref - 3 years, 10 months ago

Log in to reply

Hey, thanks!

Geoff Pilling - 3 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...