Functional problems 2009 mr.

danh

Functional problems from
Mathematical Competitions Over The World
2009
Problems

Problem 1. (11
th
CHKMO 2009)
Let
1
1 1 0
( ) ...
m m
m m
f x c x c x c x c

= + + + + , where each
i
c is a non-zero integer. Define a sequence
{ }
n
a by
1
0 a = and
1
( )
n n
a f a
+
= for all positive integers n .

(a) Let i and j be positive integers with i j < . Show that
1 j j
a a
+
is a multiple of
1 i i
a a
+
.
(b) Show that
2008
0 a .

Problem 2. (International Zhautykov Olympiad 2009, day 1)
Find all real a , such that there exist a function : f satisfying the following inequality:
( ) ( ( )) x af y y f f x + +
for all , x y .

Problem 3. (Indonesia TST 2009 First Stage Test 3 - Moldova TST 2009 Day 2)
Let S be the set of nonnegative real numbers. Find all functions : f S S which satisfy
( ) (2 ) (2 ) ( ) f x y z f xz f yz f x y z + + + = + + for all nonnegative x, y, z with x y z + .

Problem 4. (All Russian Olympiad 2009)
How many times changes the sign of the function
( ) cos cos cos cos
2 3 2009
x x x
f x x =
at the interval
2009
0,
2
(
(

?




Functional problems 2009 mr.danh

Problem 5. (China TST 2009, Quiz 2)
Consider function : f which satisfies the conditions for any mutually distinct real
numbers a,b,c,d satisfying 0
a b a d
b c d c

+ =

, ( ), ( ), ( ), ( ) f a f b f c f d are mutually different and
( ) ( ) ( ) ( )
0.
( ) ( ) ( ) ( )
f a f b f a f d
f b f c f d f c

+ =

Prove that function f is linear.

Problem 6. (2009 Japan Mathematical Olympiad Finals)
Find all functions f , defined on the non negative real numbers and taking non negative real
numbers such that
2 2
( ) ( ) ( (4 )) f x f y f x y xf y + = + + for any non negative real numbers , x y .

Problem 7. (2009 Balkan Mathematical Olympiad)
Denote by S the set of all positive integers. Find all functions : f S S such that
2 2 2 2
( ) 2 ( ) 2 ( ) f f m f n m n + = + for all , m n S .

Problem 8. (Turkey TST 2009)
Find all functions : f
+
satisfying
1
( ) f f x
x
| |
=
|
\
and ( 1) ( 1) ( ) x f x xf x + = for all
rational numbers that are bigger than 1.

Problem 9. (50
th
International Mathematical Olympiad 2009)
Determine all functions f from the set of positive integers to the set of positive integers such
that, for all positive integers a and b , there exists a non-degenerate triangle with sides of
lengths
, ( ) and ( ( ) 1). a f b f b f a +
(A triangle is non-degenerate if its vertices are not collinear.)

Problem 10. (Greek Mathematical Olympiad 2009, First round)
Let a function : f satisfying
( ( )) ( ( )) 2 ( ( ) ( )) f x f y f y f x f f x f y = for all , x y
Prove that: ( ( )) 0, f x f x x = .



Functional problems 2009 mr.danh

Solutions

Problem 1. (11th CHKMO 2009)
Let
1
1 1 0
( ) ...
m m
m m
f x c x c x c x c

= + + + + , where each
i
c is a non-zero integer. Define a sequence
{ }
n
a by
1
0 a = and
1
( )
n n
a f a
+
= for all positive integers n .

(a) Let i and j be positive integers with i j < . Show that
1 j j
a a
+
is a multiple of
1 i i
a a
+
.
(b) Show that
2008
0 a .
Solution.
a) From an elementary of an integer polynomial | ( ) ( ) a b f a f b
( ( )) ( )(mod ( ) ) P P x P x P x x
Thus
1 2 1
| , 0
i i i i
a a a a i
+ + +
> . By induction it is easy to prove that for all j > i then
1 i i
a a
+
is
a divisor of
1 j j
a a
+
.Statement (a) has been proved .
b) If exist n > 0 such that 0
n
a = then this sequence is periodic (i.e for every k > 0 then
k n k
a a
+
= )
Similarity (a) we can prove that for all t > 0 and j > i then
i t i
a a
+
is a divisor of
j t j
a a
+

From have :
1 1
| ,
j t j kn kn t
a a a a j kn
+ + + +

But
1 1
|
t j t j
a a a a
+ +
and
1 1 1 1 t kn t kn
a a a a
+ + + +
= ,we must have for each t then | |
k t t
a a
+
is a
constant .
Only need to consider the positive integer m such that 0
m
a = then it gives contradiction.

Problem 2. (International Zhautykov Olympiad 2009, day 1)
Find all real a , such that there exist a function : f satisfying the following inequality:
( ) ( ( )) x af y y f f x + +
for all , x y .
Solution.
The following result is used in my solution . Let a, b is two real number then the function ax b +
doesn't change on R if and only if 0 a = . Consider two case :
1. a > 0
Take 0 x = then ( ) ( (0)) af y y f f +
Functional problems 2009 mr.danh

Take 0 y = then (0) ( ( )) x af f f x +
Then take ( ) y f y we have
( ( )) ( ) ( (0)) af f y f y f f +
Because a > 0 so
2
(0) ( ( )) ( ) ( (0)) ay a f af f x f y f f + + .Use the first inequality we have
2 3
(0) ( ) ( (0)) ( 1) ( (0)) a y a f af y af f y a f f + + + + , and by above result we obtain that
2
1 a =
thus 1 a = .
In this case we can find out that ( ) f x x = satisfy condition .
Case 2 : 0 a = . It is easy to check that it doesn't satisfy condition
Case 3 : 0 a < . Let consider
2
( ) f x x k = + where k > 0. We wish exist k such that:
2 2 2
( ) ( ) x a y k y x k k + + + + +
Only need to choose k is large enough then
2 2 2 2
( ) 2 0 x k k x kx x k k + + + + > and
2
( ) 0 a y k y + + > .
Thus all a satisfy condition are 1 a = or a < 0.


Problem 3. (Indonesia TST 2009 First Stage Test 3 - Moldova TST 2009 Day 2)
Let S be the set of nonnegative real numbers. Find all functions : f S S which satisfy
( ) (2 ) (2 ) ( ) f x y z f xz f yz f x y z + + + = + + for all nonnegative x, y, z with x y z + .
Solution.
(0, 0, 0) P implies (0) 0 f = .
(0, , ) P x y z + ( ) (2 ) ( ) f x y z f xz yz f x y z + + + = + +
(2 ) (2 ) (2 ) f xz f yz f xz yz + = + for x y z + .
It is not hard to prove ( ) ( ) ( ) f x f y f x y + = + for , 0 x y
( ) ( ) g x f x = has cauchy equation and is increasing.
So
2 2
( ) ( ) f x g x cx = = , where c > 0.


Functional problems 2009 mr.danh

Problem 4. (All Russian Olympiad 2009)
How many times changes the sign of the function
( ) cos cos cos cos
2 3 2009
x x x
f x x =
at the interval
2009
0,
2
(
(

?
Solution.
We are looking for the number of roots of ( ) 0 f x = in
2009
(0, )
2

whose order is odd. (I take

the open interval since there is no sign change at the bounds, even if this is a root).

Roots are
2
x kp

= for any [1, 2009] k and odd p such that 0 < kp < 2009

So roots are
2
n
r n

= with [1, 2008] n and n having some odd divisors.

Order of the root
n
r is the number of odd divisors of n .

So, if

2
i
i
k m
i
odd prime p
n p =

, the order of
n
r is ( 1)
i
k +

.
So the only roots whose order is odd are roots whose all
i
k are even and so roots which may be
written
2
2
m
a (with odd a).

So the required number X is the number of integers in [1,2008] of the form
2
n or
2
2n

So [ 2008] [ 1004] 75 X = + = .


Problem 5. (China TST 2009, Quiz 2)
Consider function : f which satisfies the conditions for any mutually distinct real
numbers a,b,c,d satisfying 0
a b a d
b c d c

+ =

, ( ), ( ), ( ), ( ) f a f b f c f d are mutually different and
( ) ( ) ( ) ( )
0.
( ) ( ) ( ) ( )
f a f b f a f d
f b f c f d f c

+ =

Prove that function f is linear.
Functional problems 2009 mr.danh

Solution.
WLOG, we can assume f(0) = 0 (or consider the function f(x) f(0)) and we can also multiply a
nonzero constant to f in order to make f(1) = 1.

First we take 0 a = in the condition , we get that if distinct nonzero real numbers b,c,d satisfying
1 1 2
b d c
+ = , then
1 1 2
( ) ( ) ( ) f b f d f c
+ = . So it reminds me to consider a new function g(x) defined
as
1
( )
1
( )
g x
f
x
= ( : / {0} / {0} g ).
It is easy to check that g is also satisfying the original condition and since if distinct nonzero real
numbers b,c,d satisfying
1 1 2
b d c
+ = , then
1 1 2
( ) ( ) ( ) f b f d f c
+ = , we get that for distinct nonzero
real numbers x,y,z, if 2 x y z + = , then ( ) ( ) 2 ( ) g x g y g z + = .
i.e. for distinct nonzero real numbers x and y, if 0 x y + =/ , then ( ) ( ) 2 ( )
2
x y
g x g y g
+
+ =
since f(1)=1, we have g(1)=1.using ( ) ( ) 2 ( )
2
x y
g x g y g
+
+ = we can easily get for any nonzero
rational number x, ( ) g x x = . Then it suffices to prove g is monotone.

my method is a little tricky, I think.
we prove a lemma: for nonzero real numbers x > y > z, if
1 1 1
x y z
+ =/
, then ( ) ( ) g x g z and
( ) ( ) g y g z are both positive or negative.
lemma's proof: in the condition we take a x = , c y = , ( )( ) b z x z y z = + ,
( )( ) d z x z y z = . According to x > y > z, we have a > b > c > d. It is obvious that
, 0 a c . If b or d is 0, then
2
( )( ) z x z y z = , which leads to
1 1 1
x y z
+ = , a contradiction. So
a,b,c,d are distinct nonzero real number, i.e. they satisfies the condition in the original problem.
Thus we get
( ) ( ) ( ) ( )
0
( ) ( ) ( ) ( )
f a f b f a f d
f b f c f d f c

+ =


It equals that
( ) ( ) ( ) ( )
0
( ) ( ) ( ) ( )
g a g b g a g d
g b g c g d g c

+ =


i.e.
2
[2 ( ) ( ) ( )][2 ( ) ( ) ( )] ( ) ( ) g a g b g d g c g b g d g b g d =
since ( ) ( ) 2 ( )
2
b d
g b g d g
+
+ = we get
2
[ ( ) ( )]
[ ( ) ( )][ ( ) ( )]
2 2 4
b d b d g b g d
g a g g c g
+ +
=
Functional problems 2009 mr.danh

So
2
[ ( ) ( )]
[ ( ) ( )][ ( ) ( )] 0
4
g b g d
g x g z g y g z

= , the lemma is proved.

To finish the answer, we assume there exist a real number x such that ( ) g x x =/
case 1: ( ) g x x > , then we can find a rational number y satisfying ( ) x y g x < < and a rational
number z satisfying ( ) ( ) g z g x > and
1 1 1
z y x
+ =/ . So g(z) = z and g(y) = y, we have z > y > x but
( ) ( ) g z g x is positive while ( ) ( ) g y g x is negative, a contradiction.
case 2: ( ) g x x < is similar to get a contradiction.

so the hypothesis of the existence of such an x is wrong.i.e. g(x) = x for all nonzero x. Accoding
to the definition of g we get f(x) = x for nonzero real number x. Also f(0) = 0, so f(x) = x for all
real x, and the original f must be a linear function.


Problem 6. (2009 Japan Mathematical Olympiad Finals)
Find all functions f , defined on the non negative real numbers and taking non negative real
numbers such that
2 2
( ) ( ) ( (4 )) f x f y f x y xf y + = + + for any non negative real numbers , x y .
Solution.
First, notice that
2
( ) g x x kx = + spans all non-negative reals for non-negative values of
x , because (0) 0 g = and ( ) g x goes to infinity as x increases.
Then f is non-decreasing: if z y a = + , a > 0, then there is x > 0 such that
2
4 ( ) x f y x a + = . Choosing such x we have
2
( ) ( ) ( ) f x f y f z + = and since f can only assume
non-negative values, ( ) ( ) f z f y .
Suppose that there is k > 0 such that ( ) 0 f k = . Then, since f is non-decreasing and, by
letting 0 x y = = , (0) 0 f = , ( ) 0 f x = for 0 x k . Letting x be x and
4
k
y = , we obtain
( ) ( )
4 4 4
k k k
f x f f x f x f x
| | | | | |
+ = + + =
| | |
\ \ \
. This implies that f is periodic with period
4
k
.
Since ([0, ]) {0} f k = , ( ) 0 f x = for all non-negative x .
It remains to solve the case in which ( ) 0 f x > for all positive x . In this case, f is
strictly increasing ( ( ) ( ) f z f y turns into a strict inequality) and, henceforth, f is injective.
Substituting x by x we obtain ( ) ( ) ( (4 )) f x f y f x y x f y + = + + . By symmetry,
Functional problems 2009 mr.danh

(4 ) (4 )
( (4 )) ( (4 ))
f x f y
f x y x f y f x y y f x
x y
+ + = + + = This means that
( ) f x
x
is
constant, so ( ) f x c x = . Direct substitution yields 1 c = and we are done.

Problem 7. (2009 Balkan Mathematical Olympiad)
Denote by S the set of all positive integers. Find all functions : f S S such that
2 2 2 2
( ) 2 ( ) 2 ( ) f f m f n m n + = + for all , m n S .
Solution 1. (by pbornsztein)
First, it is clear that f is injective.

Then, note that we always have
2 2 2 2
( 3) 2 ( 1) 2( 2) x x x x + + = + + . Back to the original equation,
it follows that
2 2 2 2 2
( 3) 2 ( ) ( 1) 2 ( 2) f x f x f x f x + + = + + .

Let
2
( )
n
u f n = . Thus
3 2 1
2 2 0
n n n n
u u u u
+ +
+ = for all n > 1.
Solving this linear relation, we get that
2
( 1)
n
n
u an bn c d = + + + for all n > 0 for some constant
a,b,c,d.
Moreover, from the initial equation, we have
1 5 3
2 3 u u u + = from which we deduce that 0 b = .

Thus,
2
( 1)
n
n
u an c d = + + and is a square of an integer for all n. It's obvious that a is
nonnegative (we assume it's positive because 0 a = gives as f to be a constant function which is
not a solution). Now we shall be interested what is happening only over the even n . Let
c d b + = . So
2
an b + is a perfect square for all even n . Let n is even and
2 2
an b p + = ,
2 2 2
(2 ) 4 a n b an b q + = + = . Then
2 2
4 4 (2 ) an b p + = . If b is not equal 0 then we have 2 cases.
1) b > 0 and we get
2 2
3 (2 ) b p q = . Since b > 0 we get 2p > q so
2 2
3 ( 1) 2 1 b q q q + = + . Now
it's clear that q > n, so for large n we get a contradiction.
2) b < 0 - in the same way for large n, we get contradiction.
Thus we must have 0 b = and so a must be a square of integer. Since a is a square and 0 c d + =
it is now easy to get 0 c d = = .
Thus, for some positive integer k , we have ( ) f n kn = for all n > 0.

Back to the initial equation, we deduce that ( ) f n n = for all n > 0, which is clearly a solution.

Solution 2. (Official solution)
Functional problems 2009 mr.danh

First
2
1 (3 (1) ) 3 m n f f = = =
Then
2 2 2 2
( 2 ) 2( ) ( 2 ) 2( ) m n m n m n m n + + = + + and injectivity gives
2 2 2 2
( 2 ) 2 (| |) (| 2 |) 2 ( ) f m n f m n f m n f m n + + = + + ---- (*)
Plug
2
(1) m f = and
2 2 2 2 2 2 2
2 (1) (5 (1) ) 2 ( (1) ) 3 (3 (1) ) 27 n f f f f f f f = + = =
2 2
2 27 a b + = by solving in positive integers we get
Case 1:
2 2 2 2
(5 (1) ) 3 ( (1) ) 5 (1) (1) (1) 0 f f f f f f f = = = = , contradiction
Case 2:
2
(5 (1) ) 5 f f = and
2
( (1) ) 1 f f =
Now plug
2
3 (1) m f = and
2 2 2 2 2 2 2 2 2
(1) (5 (1) ) 2 (2 (1) ) ( (1) ) 2 (4 (1) ) n f f f f f f f f f = + = +
Solve the equation
2 2
12 x y + = has integral root ( , ) (2, 4) x y = ,
so
2
(2 (1) ) 2 f f = and
2
(4 (1) ) 4 f f =

Let's prove that
2
( (1) ) f nf n = by induction.
( ) i For 1, 2, 3, 4, 5 n = it was shown above
( ) ii Assume it is true for all n k where 5 k
( ) iii Plug
2
( 1) (1) m k f = and
2
(1) n f = in (*)
2 2 2 2 2 2 2 2
(( 1) (1) ) 2 (( 2) (1) ) (( 3) (1) ) 2 ( (1) ) f k f f k f f k f f kf + + = +
2 2 2 2 2
(( 1) (1) ) 2( 2) ( 3) 2 f k f k k k + + = +
2
(( 1) (1) ) 1 f k f k + = +
Induction completed.

(1) f is a positive integer so
2
( (1) (1) ) (1) (1) 1 f f f f f = =
So ( ) f n n = .

Functional problems 2009 mr.danh

Problem 8. (Turkey TST 2009)
Find all functions : f
+
satisfying
1
( ) f f x
x
| |
=
|
\
and ( 1) ( 1) ( ) x f x xf x + = for all
rational numbers that are bigger than 1.
Solution.
Plug 2 x = in number two: 3 (1) 2 (2) f f = , so 2 (1) f . So (1) 2 f k = , for some k .
Assume that ( )
p
f p q k
q
| |
+
|
\
, for some ( , ) 1 p q = . From number one, we can assume p > q
without the loss of generality. Furthermore assume that ( , ) p q is the number which satisfies the
condition, with the smallest p q + . If there are more that one, pick an abritary.
Plug
p
x
q
= into the second equation:
1 1 ( )
p p p p p
f f p q k
q q q q q
| | | | | |
+ = +
| | |
\ \ \
.
Dividing with
p q
q
+
:
(( ) )
p q
f pk p q q k
q
| |
= +
|
\
.
So the pair ( , ) p q q or ( , ) q p q (depending on which is largest) also satisfies the condition,
and hence we have a contradiction!
Hence the only solution is ( ) ( , ) 1, ,
p
f p q k p q p q
q
| |
= + =
|
\
for some k . Plugging it
back into the equation, we see that the solution fulfills the requirements, so we are done.

Problem 9. (50
th
International Mathematical Olympiad 2009)
Determine all functions f from the set of positive integers to the set of positive integers such
that, for all positive integers a and b , there exists a non-degenerate triangle with sides of
lengths
, ( ) and ( ( ) 1). a f b f b f a +
(A triangle is non-degenerate if its vertices are not collinear.)
Solution.
Put 1 a = , by triangle inequality,
1 ( ) ( (1) 1) ( ) ( ( ) 1) f b f b f f b f b f a + > + + .
1 ( (1) 1) ( ) ( (1) 1) ( ) f b f f b f b f f b + + > + .
Functional problems 2009 mr.danh

We get ( ) ( (1) 1) f b f b f = + .
Claim 1. (1) 1 f = .
Otherwise (1) 1 0 f > , which means that f is periodic. This means that f can take finitely
many values, so if we take a sufficiently large, a , ( ) f b , ( ( ) 1) f b f a + cannot make a
triangle, contradiction. Then, (1) 1 f = .
Claim 2. f is bijective.
Put 1 b = , we easily get ( ( )) a f f a = , so f is bijective.
Claim 3. ( ) f n n = .
See that ( ) ( ( ) 1) 1 a f b f b f a + + + .
Let b such that ( ) 2 (2) ( ( )) f b f f f b b = = =
Then 1 ( ( ) 1) a f b f a + +
Hence we can prove inductively on a that 1 ( ( ) 1) a f b f a + = + from bijection of f. Since
1 b > , replace with 1 a b = , we get ( ( ) 1) (2) ( ) 1 2 f b f a b f b f a + = = + = . So 2 b = .
Then, 1 ( ( ) 1) a f f a + = + ( ) 1 ( 1) f a f a + = + .
And ( ) f n n = for all n .


Problem 10. (Greek Mathematical Olympiad 2009, First round)
Let a function : f satisfying
( ( )) ( ( )) 2 ( ( ) ( )) f x f y f y f x f f x f y = for all , x y
Prove that: ( ( )) 0, f x f x x = .
Solution.
Let ( , ) P x y be the assertion ( ( )) ( ( )) 2 ( ( ) ( )) f x f y f y f x f f x f y =
( , ) P x x (0) 0 f =
(0, ) P x ( ( )) ( ) 2 ( ( )) f f x f x f f x = and so ( ( )) ( ) f f x f x =
( , 0) P x ( ) ( ( )) 2 ( ( )) f x f f x f f x = and so, using previous line : ( ( )) ( ) f f x f x =
Then ( , ( )) P x f x implies the required result ( ( )) 0 f x f x = .