Let us define a recursive relation of M n as follows:
⎩ ⎪ ⎨ ⎪ ⎧ M 1 = 1 M 2 = 2 M n = M n − 1 M n − 2 for n > 2
What is lo g 2 ( M 1 7 ) ?
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.
Actually, the solution is F 1 6 since Fibonacci numbers are numbered from 0 and the sequence listed is numbered from 1 .
Log in to reply
Thanks! I've updated the solution, accordingly.
nice problem !
Problem Loading...
Note Loading...
Set Loading...
Let L n = lo g 2 ( M n )
Since M n = M n − 1 × M n − 2 for n > 2 , this implies that:
L n = L n − 1 + L n − 2 for n > 2
So, the L n are simply the Fibonacci numbers, but they are off by 1. (Since Fibonacci numbers are defined F 0 = 0 , F 1 = 1 , and F 2 = 1 )
Or, L n = F n − 1 where F n are the Fibonacci numbers!
So, lo g 2 ( M 1 7 ) = L 1 7 = F 1 6 = 9 8 7