Difference between revisions of "2016 APMO Problems/Problem 5"
(→Solution) |
(→Solution) |
||
Line 9: | Line 9: | ||
<b>Claim 1:</b> <math>f</math> is injective. | <b>Claim 1:</b> <math>f</math> is injective. | ||
− | <i>Proof:</i> Assume <math>f(a)=f(b)</math> for some <math>a,b \in \mathbb{R}^+</math>. Now, from <math>P(x,y,a)</math> and <math>P(x,y,b</math> we have: | + | <i>Proof:</i> Assume <math>f(a)=f(b)</math> for some <math>a,b \in \mathbb{R}^+</math>. Now, from <math>P(x,y,a)</math> and <math>P(x,y,b)</math> we have: |
Line 16: | Line 16: | ||
Now comparing, we have <math>a=b</math> as desired. <math>\square</math> | Now comparing, we have <math>a=b</math> as desired. <math>\square</math> | ||
+ | |||
+ | <b>Claim 2:</b> <math>f</math> is surjective. | ||
+ | |||
+ | <i>Proof:</i> <math>P(x,x,z)</math> gives |
Revision as of 22:47, 12 July 2021
Problem
Find all functions such that for all positive real numbers .
Solution
We claim that is the only solution. It is easy to check that it works. Now, we will break things down in several claims. Let be the assertion to the Functional Equation.
Claim 1: is injective.
Proof: Assume for some . Now, from and we have:
Now comparing, we have as desired.
Claim 2: is surjective.
Proof: gives