Many solutions

Level pending

The positive integer-valued function f ( n ) f(n) satisfies f ( f ( n ) ) = 4 n f(f(n)) = 4n and f ( n + 1 ) > f ( n ) > 0 f(n + 1) > f(n) > 0 for all positive integers n n . Let N N be the number of possible 64-tuples ( f ( 1 ) , f ( 2 ) , f ( 3 ) , , f ( 64 ) ) (f(1), f(2), f(3), \dots, f(64)) . Find N N mod 1000.


The answer is 779.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...