There are 2 strictly increasing functions f and g that map positive integers to positive integers. It is known that f ( f ( x ) ) = g ( x ) for all positive integers x . It is given that g ( x ) = a x + b .
Jasmine and Luke and perfect logicians and functional experts. Jasmine is told the value of a + b . Luke is given b .
Jasmine is then given y = 2 0 1 9 . What value of f ( 2 0 1 9 ) does she give?
Based on the topic of this question .
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.
Where does the form of the argument x come from?
Log in to reply
Do you mean the 2 n + 2 n − 1 − 2 and 2 n − 2 part? This can be determined by working through the values we already know: x : f ( x ) : g ( x ) : 1 2 4 2 4 6 4 6 1 0 6 1 0 1 4 1 0 1 4 2 2 . . . . . . . . . 2 n − 2 2 n + 2 n − 1 − 2 2 n + 1 − 2 2 n + 2 n − 1 − 2 2 n + 1 − 2 2 n + 1 + 2 n − 2 2 n + 1 − 2 2 n + 1 + 2 n − 2 2 n + 2 − 2
In binary, this is: x : f ( x ) : g ( x ) : 1 1 0 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 0 . . . . . . . . . 1 1 1 . . . 1 1 0 1 0 1 1 . . . 1 1 0 1 1 1 1 . . . 1 1 0 1 0 1 1 . . . 1 1 0 1 1 1 1 . . . 1 1 0 1 0 1 1 1 . . . 1 1 0 1 1 1 1 . . . 1 1 0 1 0 1 1 1 . . . 1 1 0 1 1 1 1 1 . . . 1 1 0
f(x) need not be a linear function. It can be any function. This is where I got stuck
Log in to reply
f(x) needs to be linear because of that f(f(x)) is also linear
Log in to reply
f ( x ) Linear ⟹ f ( f ( x ) ) Linear.
But
f ( f ( x ) ) Linear = ⟹ f ( x ) Linear.
We are given the latter, and hence can't claim f ( x ) is linear.
Problem Loading...
Note Loading...
Set Loading...
First we can note that if g ( 1 ) = 3 , 4 we cannot uniquely determine f ( 1 ) or any other value of f ( x ) .
Hence "Jasmine: I know infinitely many values of f ( x ) " ⟹ a + b = 1 , 3 , 4 .
Second, we can work out that for all strictly increasing, linear g ( x ) we can uniquely determine ALL values of f ( x ) .
"Jasmine: It depends." ⟹ k = 3
"Luke: Then, if I was given y , I could determine f ( y ) " means that Luke, from knowledge of both a and b , can uniquely determine all values of f ( x ) . There is only one linear g ( x ) , with g ( 1 ) = 4 , that does this, and that is g ( x ) = 2 x + 2 . With \g(1) = 1, b = 0, -2) uniquely determines all values of f ( x ) . b = 2 is the only value that is only present in one of n = 1 , 4 .
Using this, one can determine that f ( f ( 2 n + 2 n − 1 − 2 ) ) ) = f ( 2 n + 1 − 2 ) ) = 2 n + 1 + 2 n − 2
For x = ( 2 n − 2 ) + c < 2 n + 2 n − 1 − 2 , f ( x ) = ( 2 n + 2 n − 1 − 2 ) + c , as f ( x ) is strictly increasing.
From these values we can determine that, for x = ( 2 n + 2 n − 1 − 2 ) + c < 2 n + 1 − 2 , f ( x ) = ( 2 n + 2 n − 1 − 2 ) + 2 c .
2 0 1 9 = ( 1 0 2 4 + 5 1 2 − 2 ) + 4 8 5 < 2 0 4 8 − 2 , Hence f ( 2 0 1 9 ) = ( 2 0 4 8 − 2 ) + 2 ∗ 4 8 5 = 3 0 1 6 .