Difference between revisions of "2014 USAMO Problems/Problem 2"
m (→Solution) |
m |
||
Line 37: | Line 37: | ||
<cmath>m^2f(4k - m^2) = f(m^3) = 0</cmath> | <cmath>m^2f(4k - m^2) = f(m^3) = 0</cmath> | ||
Then we can let <math>k</math> be anything except 0, and get <math>f(x)</math> is 0 for all <math>x \equiv 3 \pmod{4}</math> except <math>-m^2</math>. Also since <math>x^2f(-x) = f(x)^2</math>, we have <math>f(x) = 0 \Rightarrow f(-x) = 0</math>, so <math>f(x)</math> is 0 for all <math>x \equiv 1 \pmod{4}</math> except <math>m^2</math>. So <math>f(x)</math> is 0 for all <math>x</math> except <math>\pm m^2</math>. Since <math>f(m) \neq 0</math>, <math>m = \pm m^2</math>. Squaring, <math>m^2 = m^4</math> and dividing by <math>m</math>, <math>m = m^3</math>. Since <math>f(m^3) = 0</math>, <math>f(m) = 0</math>, which is a contradiction, so our only solutions are <math>f(x) = 0</math> and <math>f(x) = x^2</math>. | Then we can let <math>k</math> be anything except 0, and get <math>f(x)</math> is 0 for all <math>x \equiv 3 \pmod{4}</math> except <math>-m^2</math>. Also since <math>x^2f(-x) = f(x)^2</math>, we have <math>f(x) = 0 \Rightarrow f(-x) = 0</math>, so <math>f(x)</math> is 0 for all <math>x \equiv 1 \pmod{4}</math> except <math>m^2</math>. So <math>f(x)</math> is 0 for all <math>x</math> except <math>\pm m^2</math>. Since <math>f(m) \neq 0</math>, <math>m = \pm m^2</math>. Squaring, <math>m^2 = m^4</math> and dividing by <math>m</math>, <math>m = m^3</math>. Since <math>f(m^3) = 0</math>, <math>f(m) = 0</math>, which is a contradiction, so our only solutions are <math>f(x) = 0</math> and <math>f(x) = x^2</math>. | ||
+ | |||
+ | [[Category:Olympiad Algebra Problems]] | ||
+ | [[Category:Functional Equation Problems]] |
Revision as of 08:19, 19 July 2016
Problem
Let be the set of integers. Find all functions
such that
for all
with
.
Solution
Note: This solution is kind of rough. I didn't want to put my 7-page solution all over again. It would be nice if someone could edit in the details of the expansions.
Lemma 1: .
Proof: Assume the opposite for a contradiction. Plug in
(because we assumed that
),
. What you get eventually reduces to:
which is a contradiction since the LHS is divisible by 2 but not 4.
Then plug in into the original equation and simplify by Lemma 1. We get:
Then:
Therefore, must be 0 or
.
Now either is
for all
or there exists
such that
. The first case gives a valid solution. In the second case, we let
in the original equation and simplify to get:
But we know that
, so:
Since
is not 0,
is 0 for all
(including 0). Now either
is 0 for all
, or there exists some
such that
. Then
must be odd. We can let
in the original equation, and since
is 0 for all
, stuff cancels and we get:
[b]for
.[/b]
Now, let
and we get:
Now, either both sides are 0 or both are equal to
. If both are
then:
which simplifies to:
Since
and
is odd, both cases are impossible, so we must have:
Then we can let
be anything except 0, and get
is 0 for all
except
. Also since
, we have
, so
is 0 for all
except
. So
is 0 for all
except
. Since
,
. Squaring,
and dividing by
,
. Since
,
, which is a contradiction, so our only solutions are
and
.