Scary Functional Equation
by utkarshgupta, Nov 8, 2015, 4:49 PM
Problem : (ISL 2007)
Find all functions
satisfying
for all pairs of positive reals
and
. Here,
denotes the set of all positive reals.
Solution 1 :
Let
the problem statement can be rewritten as
Also,

Suppose
for some 
a contradiction.
is a well defined function from 
Let
be the assertion 
Using
and
we have,
Let
be the assertion 

Let


Using 

Choosing
, we have 



Now the problem should be easy (I will add soon)
Solution 2 :
Let
be the assertion 
Lemma 1
Suppose
for some 
a contradiction.
Thus the lemma
Lemma 2 :
is injective.
Let
and without loss of generality, 



That is
is periodic in the interval
.
But this can't be true because of lemma 1.
Hence
is injective.
Main Proof :



Let




Using this,

Obviously, by Lemma 2,

Thus we have,

Case 1

Using injectivity,



is additive.
Replacing
by
, we get
If



Case 2

Injectivity implies,

Replacing
by
,

For each
we can find such an
such that either of the two conditions hold.
Suppose we cannot find such an


is a constant function.
A contradiction.
The only solution is

Solution 3 :
We can establish injectivity as in the above solution.
Let
be the assertion 



Now observe


That is we have



That is
is additive.




Find all functions





Solution 1 :
Let

the problem statement can be rewritten as


Suppose





Let


Using






Let






Choosing





Now the problem should be easy (I will add soon)
Solution 2 :
Let


Lemma 1

Suppose



Thus the lemma
Lemma 2 :

Let





That is


But this can't be true because of lemma 1.
Hence

Main Proof :



Let





Using this,

Obviously, by Lemma 2,


Thus we have,

Case 1







Replacing


If




Case 2








For each


Suppose we cannot find such an





A contradiction.
The only solution is

Solution 3 :
We can establish injectivity as in the above solution.
Let





Now observe



That is we have



That is





This post has been edited 4 times. Last edited by utkarshgupta, Dec 17, 2017, 12:53 PM