Difference between revisions of "2024 USAJMO Problems/Problem 5"
(→Solution 3(Unfinished)) |
(→Solution 3) |
||
(6 intermediate revisions by the same user not shown) | |||
Line 90: | Line 90: | ||
~sml1809 | ~sml1809 | ||
− | ==Solution 3 | + | ==Solution 3== |
Start with <math>y = 0</math> to get: <math>f(x^{2}) = f(f(x)) + f(0)</math>. Then substitute <math>x = 0</math> to get: <math>f(-y) + 2yf(0) = f(f(0)) + f(y)</math>. We will show that <math>f(f(0)) = 0</math>. Substitute <math>x = y = 0</math> to get <math>f(0) = f(f(0)) + f(0)</math> which yields the desired <math>f(f(0)) = 0</math>. Hence, <math>f(-x) + 2xf(0) = f(x)</math> since <math>y</math> is just a dummy variable. Now we solve for <math>f(0)</math> in our two equations we found. We have that <math>f(0) = f(x^{2}) - f(f(x))</math> from the first equation and that <math>f(0) = \frac{f(x) - f(-x)}{2x}</math> from the second equation. | Start with <math>y = 0</math> to get: <math>f(x^{2}) = f(f(x)) + f(0)</math>. Then substitute <math>x = 0</math> to get: <math>f(-y) + 2yf(0) = f(f(0)) + f(y)</math>. We will show that <math>f(f(0)) = 0</math>. Substitute <math>x = y = 0</math> to get <math>f(0) = f(f(0)) + f(0)</math> which yields the desired <math>f(f(0)) = 0</math>. Hence, <math>f(-x) + 2xf(0) = f(x)</math> since <math>y</math> is just a dummy variable. Now we solve for <math>f(0)</math> in our two equations we found. We have that <math>f(0) = f(x^{2}) - f(f(x))</math> from the first equation and that <math>f(0) = \frac{f(x) - f(-x)}{2x}</math> from the second equation. | ||
Line 112: | Line 112: | ||
Hence, <math>f(-x) = f(x)</math> and thus <math>f(x)</math> is an even function. | Hence, <math>f(-x) = f(x)</math> and thus <math>f(x)</math> is an even function. | ||
− | < | + | <b>Claim:</b> <math>f</math> cannot have degree at least <math>4</math> |
− | < | + | <b>Proof:</b> |
Assume <math>f</math> is a polynomial. Assume there exists a solution of which <math>f</math> has degree at least <math>4</math>. Hence, <math>f(x) = a_n x^{2n} + a_{n - 1} x^{2n - 2} + ... + a_1 x^{2} + a_0</math> where <math>n \geq 2</math>. If we go back to the original equation in the problem statement and plug in <math>y = x^{2}</math>, then we have: | Assume <math>f</math> is a polynomial. Assume there exists a solution of which <math>f</math> has degree at least <math>4</math>. Hence, <math>f(x) = a_n x^{2n} + a_{n - 1} x^{2n - 2} + ... + a_1 x^{2} + a_0</math> where <math>n \geq 2</math>. If we go back to the original equation in the problem statement and plug in <math>y = x^{2}</math>, then we have: | ||
Line 134: | Line 134: | ||
Hence, all the <math>x</math> terms must cancel out for that to be a constant. This can be achieved by either <math>a = 0</math> and <math>b</math> can be anything OR <math>b = 0</math> and <math>a - a^{3} = 0</math>. Now if <math>a = 0</math>, then <math>f(x) = bx</math> but recall that <math>f(x)</math> is an even function and hence <math>b = 0</math> is the only suitable option for a linear function to turn into an even function. Hence, <math>f(x) = 0</math> is a solution. If <math>b = 0</math> and <math>a - a^{3} = 0</math>, then <math>a = 1, -1, 0</math> and hence <math>f(x) = x^{2}, -x^{2}</math> are two more new solutions. | Hence, all the <math>x</math> terms must cancel out for that to be a constant. This can be achieved by either <math>a = 0</math> and <math>b</math> can be anything OR <math>b = 0</math> and <math>a - a^{3} = 0</math>. Now if <math>a = 0</math>, then <math>f(x) = bx</math> but recall that <math>f(x)</math> is an even function and hence <math>b = 0</math> is the only suitable option for a linear function to turn into an even function. Hence, <math>f(x) = 0</math> is a solution. If <math>b = 0</math> and <math>a - a^{3} = 0</math>, then <math>a = 1, -1, 0</math> and hence <math>f(x) = x^{2}, -x^{2}</math> are two more new solutions. | ||
− | Now we have to consider if <math>f(x)</math> is not a polynomial. ( | + | Now we have to consider if <math>f(x)</math> is not a polynomial. |
+ | |||
+ | <b>Claim:</b> <math>f</math> has to be a polynomial to satisfy the given problem statement | ||
+ | |||
+ | <b>Proof:</b> | ||
+ | |||
+ | We will first show that <math>f(f(x)) = x^{2} f(x)</math>. Substitute <math>y = \frac{x^{2}}{2}</math>: | ||
+ | |||
+ | <math>f(\frac{x^{2}}{2}) + x^{2} f(x) = f(f(x)) + f(\frac{x^{2}}{2})</math>. Hence, the lemma. <math>\square</math> | ||
+ | |||
+ | We have already shown that if <math>f</math> is injective, then <math>f</math> is even and this proof lies in the case of when <math>f</math> is injective. Hence, <math>f(x)</math> is an even function. Recall that <math>f(x^{2}) = f(f(x)) + f(0)</math>. Hence, <math>f(x^{2}) = x^{2} f(x) + f(0)</math>. Now we plug in <math>x = 1</math> to get <math>f(1) = f(1) + f(0)</math> and hence <math>f(0) = 0</math>. In other words, <math>f(x^{2}) = x^{2} f(x)</math>. (Haven't finished proof yet) | ||
Case 2: <math>f</math> is not an injective function | Case 2: <math>f</math> is not an injective function | ||
− | We can prove that <math>f</math> has to be injective. This is shown in | + | We can prove that <math>f</math> has to be injective. This is shown in sml1809's solution above in which we claim <math>f(a) = f(b) \neq 0</math> and substitute <math>x = a, y = b^{2}</math> and <math>x = b, y = a^{2}</math> to prove the claim that <math>f</math> has to be injective. |
~ilikemath247365 | ~ilikemath247365 |
Latest revision as of 22:43, 23 August 2025
Problem
Find all functions that satisfy
for all
.
Solution 1
Plugging in as
\begin{equation}
f(x^2)=f(f(x))+f(0) \text{ } (1)
\end{equation}
Plugging in
as
or
Plugging in
as
but since
\begin{equation}
f(-y)+2yf(0)=f(y) \text{ } (2)
\end{equation}
Plugging in
instead of
in the given equation:
Replacing
and
:
The difference would be:
\begin{equation}
f(x^2-y^2)-f(y^2-x^2)+2y^2f(x)-2x^2f(y)=f(f(x))-f(x^2)-(f(f(y))-f(y^2)) \text{ } (3)
\end{equation}
The right-hand side would be
by
Also,
by
So,
is reduced to:
Regrouping and dividing by 2:
Because this holds for all x and y,
is a constant. So,
.
This function must be even, so
.
So, along with
,
for all
, so
, and
.
Plugging in
for
in the original equation, we get:
So,
or
All of these solutions work, so the solutions are
.
-codemaster11
Solution 2
Let our equation be . We start by plugging in some initial values:
Plugging in into
gives
From
, we get
Substituting in what we have in
gives
Plugging in
gives
As a result,
becomes
.
Now, becomes
and
becomes
Note that
is a solution. Now, assume
.
Claim: is injective over
.
Let with
. Plugging in
and
into
gives us
Subtracting, and using
gives us
, which implies that either
or
. Either way leads to contradiction. Thus,
is injective.
As a result, becomes
. Piecing everything yields
.
It just remains to verify these solutions work, and doing so is quite trivial;
all of which are obviously true.
~sml1809
Solution 3
Start with to get:
. Then substitute
to get:
. We will show that
. Substitute
to get
which yields the desired
. Hence,
since
is just a dummy variable. Now we solve for
in our two equations we found. We have that
from the first equation and that
from the second equation.
Hence, we set these equal to get:
Replace with
to get:
Now add to get:
Now since can't obviously be equal to
, we need
.
Case 1: is an injective function
Hence, and thus
is an even function.
Claim: cannot have degree at least
Proof:
Assume is a polynomial. Assume there exists a solution of which
has degree at least
. Hence,
where
. If we go back to the original equation in the problem statement and plug in
, then we have:
So we have:
Hence,
But we know has degree
so the
will have degree
but the
will have degree
. Solving
will have no integer solutions. Recall that
. Clearly, no functions will satisfy this equation and the claim is proven.
We have shown that can have degree at most
if it is an injective function. Hence, let
. Recall that we had shown earlier that
. Hence,
but we know
. Hence,
which yields
. Clearly,
has to occur. Hence,
. Now, recall we showed that
. Hence,
. Plugging and simplifying, we eventually get:
Hence, all the terms must cancel out for that to be a constant. This can be achieved by either
and
can be anything OR
and
. Now if
, then
but recall that
is an even function and hence
is the only suitable option for a linear function to turn into an even function. Hence,
is a solution. If
and
, then
and hence
are two more new solutions.
Now we have to consider if is not a polynomial.
Claim: has to be a polynomial to satisfy the given problem statement
Proof:
We will first show that . Substitute
:
. Hence, the lemma.
We have already shown that if is injective, then
is even and this proof lies in the case of when
is injective. Hence,
is an even function. Recall that
. Hence,
. Now we plug in
to get
and hence
. In other words,
. (Haven't finished proof yet)
Case 2: is not an injective function
We can prove that has to be injective. This is shown in sml1809's solution above in which we claim
and substitute
and
to prove the claim that
has to be injective.
~ilikemath247365
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.