What can be said about the number of all possible solutions of the following functional equation?
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.
It is easy to see that any function of the form f ( x ) = 3 2 x + g ( x ) is a solution of the given functional equation, where g ( x ) + g ( 2 1 x ) = 0 . ( ∗ ) It can be proved that there are infinitely many possible functions g ( x ) . For example, for any real number c = 0 , we can define a function g c as a piecewise function in the following way: g c ( 2 n ) = ( − 1 ) n c , for any integer n , and g c ( x ) = 0 , if x is any real number that cannot be represented as 2 n , where n is any integer number. It is obvious that any g c satisfies the equation ( ∗ ) and the number of possible function of this type is infinite, because if c 1 = c 2 , then g c 1 = g c 2 .