Browse · MathNet
PrintEuropean Mathematical Cup
North Macedonia algebra
Problem
Find all functions such that for all the following holds:
Solution
Let be the assertion .
gives us and gives us By combining (1) and (2) we get gives us , thus we have two cases:
Case 1. .
gives us while , gives us Combining (4) and (5) and using (3) we get The assertion can be written as For an arbitrary , let us denote . Using (4) we get: Using (1) and (6) we get Plugging the last 4 equations in (7) we get: which is equivalent to Therefore and . Now if we use (6) in (1) we get so for every , now using (6) we conclude for all which is easily checked to be a solution.
Case 2. .
We immediately see using that By comparing and and using (3) we get: If there exists such that we have for all Plugging in in here gives us: Specially, . Now, : Let denote the statement . If there is no such that then for all . gives us which gives us another solution . Now, let us assume that there exists such that holds. Obviously, holds, as well. gives us and (10) gives us Therefore, also holds. Inductively, we deduce that holds for every . Also, , which means that is unbounded.
, using the fact : and since and (this follows from ) we have which implies that is bounded and that is contradiction. Therefore, there is no such that and therefore Therefore, using (11): can now be written as follows: and similarly, can be written as: Subtracting the previous two equalities: Assume that for some , . Let and . Now we have: i.e.: If we plug in , in (13) we get: i.e.: If (15) gives us: while (14) gives us: Thus, and which implies . On the other hand, if we also have .
gives us and gives us By combining (1) and (2) we get gives us , thus we have two cases:
Case 1. .
gives us while , gives us Combining (4) and (5) and using (3) we get The assertion can be written as For an arbitrary , let us denote . Using (4) we get: Using (1) and (6) we get Plugging the last 4 equations in (7) we get: which is equivalent to Therefore and . Now if we use (6) in (1) we get so for every , now using (6) we conclude for all which is easily checked to be a solution.
Case 2. .
We immediately see using that By comparing and and using (3) we get: If there exists such that we have for all Plugging in in here gives us: Specially, . Now, : Let denote the statement . If there is no such that then for all . gives us which gives us another solution . Now, let us assume that there exists such that holds. Obviously, holds, as well. gives us and (10) gives us Therefore, also holds. Inductively, we deduce that holds for every . Also, , which means that is unbounded.
, using the fact : and since and (this follows from ) we have which implies that is bounded and that is contradiction. Therefore, there is no such that and therefore Therefore, using (11): can now be written as follows: and similarly, can be written as: Subtracting the previous two equalities: Assume that for some , . Let and . Now we have: i.e.: If we plug in , in (13) we get: i.e.: If (15) gives us: while (14) gives us: Thus, and which implies . On the other hand, if we also have .
Final answer
f(x) = 0 for all x; f(x) = 1/2 for all x; f(x) = x^2 for all x
Techniques
Functional Equations