Let G be the set of all functions f from the set of positive reals to the set of positive reals such that
f ( 3 x ) ≥ f ( f ( 2 x ) ) + x , ∀ x ∈ R + .
Find the maximum real number k such that for all such functions f ∈ G , the following holds:
f ( x ) ≥ k x .
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.
Nice problem ! First note that for all the functions f ∈ B , we have the following series of inequalities valid for all x ∈ R + :
f ( 3 x ) ≥ f ( f ( 2 x ) ) + x ≥ τ f ( 2 x ) + x ≥ 2 τ 2 x + x = ( 1 + 2 τ 2 ) x ,
i.e., f ( x ) ≥ 3 ( 1 + 2 τ 2 ) x , ∀ x ∈ R +
Hence by definition of τ , we have τ ≥ 3 ( 1 + 2 τ 2 ) , i.e. 2 1 ≤ τ ≤ 1 . Now to show that τ = 2 1 , we simply note that the function g ( x ) = 2 1 x , ∀ x ∈ R + belongs to the set B .
Problem Loading...
Note Loading...
Set Loading...
Nice problem Anqi! :D