Let is the greatest odd divisor of . We define a function such that: and . Find the number of composition such that
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.
First observe that f ( 2 k ) = 2 k − 1 + 2 k = 3 . 2 k − 1
f 2 ( 2 k ) = 3 . 2 k − 2 + 2 k − 1
Continuing like this it can be simplified as : f m ( 2 k ) = 2 k − m . ( 2 m + 1 )
Now observe the following pattern :
f ( 1 ) = 2 f 2 ( 1 ) = 3 f 3 ( 1 ) = 4 f 4 ( 1 ) = 6 f 5 ( 1 ) = 5 f 6 ( 1 ) = 8 . . . . f 1 0 ( 1 ) = 1 6 . . . . f 1 5 ( 1 ) = 3 2
The powers of 2 occurs at the values of terms of an series whose common difference is an A.P.The series is ( 1 , 3 , 6 , 1 0 , 1 5 , . . . . ) .Its general term is 2 n ( n + 1 )
Now 2 0 1 6 = 3 2 × 6 3 = 2 5 × ( 2 . 3 1 + 1 )
From the above equation 2 m + 1 = 6 3 m = 3 1 k − m = 5 k = 3 1 + 5 = 3 6
So, we need f m ( 2 3 6 ) .The value of m = 3 6 . 3 7 / 2 = 6 6 6
Now f 6 6 6 ( 1 ) = 2 3 6
Now consider f 6 6 6 + l ( 1 ) = 2 3 6 − l . ( 2 l + 1 ) .From the above factorization we get l = 3 1
Now the equation becomes f 6 6 6 + 3 1 ( 1 ) = 2 3 6 − 3 1 . ( 2 . 3 1 + 1 ) f 6 9 7 ( 1 ) = 2 5 . 6 3 = 2 0 1 6
So, the value of k = 6 9 7
Nice question