Fourth Loneliest Number

Algebra Level 4

Consider the recurrence relation f n ( x ) = x f n 1 ( x ) f_n (x) = x^{f_{n-1}(x)} with f 0 ( x ) = 16 f_0(x) = 16 . Find the number of integer solutions of n n in between 1 and 1000 inclusive such that f n ( 2 4 ) = 16 f_n(\sqrt[4]2) = 16 .


The answer is 1000.

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

We need to solve for n n in the equation

f n ( 2 4 ) = ( 2 4 ) f n 1 ( 2 4 ) = 16 = ( 2 4 ) 16 f_n(\sqrt[4]{2})=(\sqrt[4]{2})^{f_{n-1}(\sqrt[4]{2})}=16=(\sqrt[4]{2})^{16}

This means that if f n 1 ( 2 4 ) = 16 f_{n-1}(\sqrt[4]{2})=16 , then f n ( 2 4 ) = 16 f_{n}(\sqrt[4]{2})=16 .

Since, f 0 ( x ) = 16 f_0(x)=16 for all x, f 1 ( 2 4 ) = 16 f_1(\sqrt[4]{2})=16 and by induction

n = 1 , 2 , 3 , , 999 , 1000 n=1,2,3,\cdots,999,1000 are all valid solutions.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...