Consider the recurrence relation with . Find the number of integer solutions of in between 1 and 1000 inclusive 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.
We need to solve for n in the equation
f n ( 4 2 ) = ( 4 2 ) f n − 1 ( 4 2 ) = 1 6 = ( 4 2 ) 1 6
This means that if f n − 1 ( 4 2 ) = 1 6 , then f n ( 4 2 ) = 1 6 .
Since, f 0 ( x ) = 1 6 for all x, f 1 ( 4 2 ) = 1 6 and by induction
n = 1 , 2 , 3 , ⋯ , 9 9 9 , 1 0 0 0 are all valid solutions.