Skip to main content
OlympiadHQ

Browse · MathNet

Print

BMO 2022 shortlist

2022 algebra

Problem

Find all functions such that for all .
Solution
Setting we get for every . From (1) it is immediate that is increasing.

Claim.

Proof of Claim. Let . If , taking and we have , so and . Thus , a contradiction. Assume now for contradiction that . We claim that for every . We proceed by induction, the case being trivial. The inductive step follows easily by taking in (1). Now taking , in (1) we get giving But this leads to a contradiction if is large enough. □

Now for we get and since inductively we get for every . For , setting we get Since is strictly increasing with for every we deduce that for every . It is easily checked that this satisfies the functional equation.
Final answer
f(x) = x for all x > 0

Techniques

Injectivity / surjectivityInduction / smoothing