An Elegant function with elegant conditions

Algebra Level 5

{ f ( 1 ) = 1 f ( 3 ) = 3 f ( 2 n ) = f ( n ) f ( 4 n + 1 ) = 2 f ( 2 n + 1 ) f ( n ) f ( 4 n + 3 ) = 3 f ( 2 n + 1 ) 2 f ( n ) \begin {cases} f(1) =1 \\f(3) =3 \\f(2n) = f(n)\\ f(4n+1) =2f(2n+1)-f(n)\\ f(4n+3)=3f(2n+1)-2f(n) \end {cases} The function f f is defined on the set of all positive integers as above. Find the number of n n with f ( n ) = n f(n)=n for 1 n 1988 1\leq n\leq 1988 .


The answer is 92.

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

Mark Hennings
Nov 3, 2016

Try looking here .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...