A number theory problem by Ilham Saiful Fauzi

Let d ( n ) d(n) is the greatest odd divisor of n n . We define a function f f such that: f ( 2 n 1 ) = 2 n f(2n-1)=2^{n} and f ( 2 n ) = n + 2 n d ( n ) f(2n)=n+\dfrac{2n}{d(n)} . Find the number of composition k k such that f k ( 1 ) = 2016 f^{k}(1)=2016


The answer is 697.

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

Kushal Bose
Sep 16, 2016

First observe that f ( 2 k ) = 2 k 1 + 2 k = 3. 2 k 1 f(2^k)=2^{k-1}+2^k=3.2^{k-1}

f 2 ( 2 k ) = 3. 2 k 2 + 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 ) 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 10 ( 1 ) = 16 . . . . f 15 ( 1 ) = 32 f(1)=2 \\ f^2(1)=3 \\ f^3(1)=4 \\ f^4(1)=6 \\ f^5(1)=5 \\ f^6(1)=8 \\ .... \\ f^{10}(1)=16 \\ .... \\ f^{15}(1)=32

The powers of 2 2 occurs at the values of terms of an series whose common difference is an A.P.The series is ( 1 , 3 , 6 , 10 , 15 , . . . . ) (1,3,6,10,15,....) .Its general term is n ( n + 1 ) 2 \frac{n(n+1)}{2}

Now 2016 = 32 × 63 = 2 5 × ( 2.31 + 1 ) 2016=32 \times 63=2^5 \times (2.31+1)

From the above equation 2 m + 1 = 63 m = 31 k m = 5 k = 31 + 5 = 36 2 m+1=63 \\ m=31 \\ k-m=5 \\ k=31+5=36

So, we need f m ( 2 36 ) f^m(2^{36}) .The value of m = 36.37 / 2 = 666 m=36.37/2=666

Now f 666 ( 1 ) = 2 36 f^{666}(1)=2^{36}

Now consider f 666 + l ( 1 ) = 2 36 l . ( 2 l + 1 ) f^{666+l}(1)=2^{36-l}.(2 l+1) .From the above factorization we get l = 31 l=31

Now the equation becomes f 666 + 31 ( 1 ) = 2 36 31 . ( 2.31 + 1 ) f 697 ( 1 ) = 2 5 . 63 = 2016 f^{666+31}(1)=2^{36-31}.(2.31+1) \\ f^{697}(1)=2^5.63=2016

So, the value of k = 697 k= \boxed{697}

Nice question

Thank you so much

Ilham Saiful Fauzi - 4 years, 9 months ago

Nice solution and awesome observation

Muhammad Adnan - 2 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...