2024 USAJMO Problems/Problem 5: Difference between revisions
Erinb28lms (talk | contribs) m →Problem |
Virjoy2001 (talk | contribs) |
||
| Line 8: | Line 8: | ||
== Solution 1 == | == Solution 1 == | ||
I will denote the original equation <math>f(x^2-y)+2yf(x)=f(f(x))+f(y)</math> as OE. | |||
I claim that the only solutions are <math>f(x) = -x^2, f(x) = 0,</math> and <math>f(x) = x^2.</math> | |||
Lemma 1: <math>f(0) = 0.</math> | |||
Proof of Lemma 1: | |||
We prove this by contradiction. Assume <math>f(0) = k \neq 0.</math> | |||
By letting <math>x=y=0</math> in the OE, we have <cmath>f(0) = f^2(0) + f(0) \Longrightarrow f^2(0) = 0 \Longrightarrow f(k) = 0.</cmath> | |||
If we let <math>x = 0</math> and <math>y = k^2</math> in the OE, we have | |||
<cmath>f(-k^2) + 2k^2f(0) = f^2(0) + f(k^2) \Longrightarrow f(-k^2) + 2k^3 = f(k^2)</cmath> and if we let <math>x = k</math> and <math>y = k^2</math> in the OE, we get | |||
<cmath>f(0) + 2k^2f(k) = f^2(k) + f(k^2) \Longrightarrow k = k + f(k^2) \Longrightarrow f(k^2) = 0 \Longrightarrow f(-k^2) = 2k^3. </cmath> | |||
However, upon substituting <math>x = k</math> and <math>y = -k^2</math> in the OE, this implies | |||
<cmath>f(0) -2k^2f(k) = f^2(k) + f(-k^2) \Longrightarrow k = k + 2k^3 \Longrightarrow 2k^3 = 0.</cmath> | |||
This means <math>k = 0,</math> but we assumed <math>k \neq 0,</math> contradiction, which proves the Lemma. | |||
Substitute <math>y = 0</math> in the OE to obtain | |||
<cmath>f(x^2) = f^2(x) + f(0) = f^2(x)</cmath> | |||
and let <math>y = x^2</math> in the OE to get | |||
<cmath>f(0) + 2x^2 f(x) = f^2(x) + f(x^2) = 2f(x^2) = 2x^2 f(x) \Longrightarrow \dfrac{f(x)}{x^2} = \dfrac{f(x^2)}{x^4} \Longrightarrow f(x) \propto x^2.</cmath> | |||
Thus we can write <math>f(x) = kx^2</math> for some <math>k.</math> By <math>f(x^2) = f^2(x),</math> we have <cmath>kx^4 = k^3x^4,</cmath> so <math>k = -1, 0, 1,</math> yielding the solutions <cmath>f(x) = -x^2, f(x) = 0, f(x) = x^2. \blacksquare</cmath> | |||
- [https://artofproblemsolving.com/wiki/index.php/User:Spectraldragon8 spectraldragon8] | |||
==See Also== | ==See Also== | ||
{{USAJMO newbox|year=2024|num-b=4|num-a=6}} | {{USAJMO newbox|year=2024|num-b=4|num-a=6}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 12:04, 24 March 2024
Problem
Find all functions
that satisfy
for all
.
Solution 1
I will denote the original equation
as OE.
I claim that the only solutions are
and
Lemma 1:
Proof of Lemma 1:
We prove this by contradiction. Assume
By letting
in the OE, we have
If we let
and
in the OE, we have
and if we let
and
in the OE, we get
However, upon substituting
and
in the OE, this implies
This means
but we assumed
contradiction, which proves the Lemma.
Substitute
in the OE to obtain
and let
in the OE to get
Thus we can write
for some
By
we have
so
yielding the solutions
See Also
| 2024 USAJMO (Problems • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAJMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination