Difference between revisions of "2014 USAMO Problems/Problem 2"
(→Problem) |
m (→Solution: RHS -> LHS) |
||
Line 7: | Line 7: | ||
Proof: Assume the opposite for a contradiction. Plug in <math>x = 2f(0)</math> (because we assumed that <math>f(0) \neq 0</math>), <math>y = 0</math>. What you get eventually reduces to: | Proof: Assume the opposite for a contradiction. Plug in <math>x = 2f(0)</math> (because we assumed that <math>f(0) \neq 0</math>), <math>y = 0</math>. What you get eventually reduces to: | ||
<cmath>4f(0)-2 = \left( \frac{f(2f(0))}{f(0)} \right)^2</cmath> | <cmath>4f(0)-2 = \left( \frac{f(2f(0))}{f(0)} \right)^2</cmath> | ||
− | which is a contradiction since the | + | which is a contradiction since the LHS is divisible by 2 but not 4. |
Then plug in <math>y = 0</math> into the original equation and simplify by Lemma 1. We get: | Then plug in <math>y = 0</math> into the original equation and simplify by Lemma 1. We get: | ||
Line 13: | Line 13: | ||
Then: | Then: | ||
− | + | \begin{align*} | |
− | x^6f(x) &= x^4(-x)^2f(-(-x)) \\ | + | <math>x^6f(x) &= x^4(-x)^2f(-(-x)) \\ |
&= x^4f(-x)^2 \\ | &= x^4f(-x)^2 \\ | ||
− | &= f(x)^4 | + | &= f(x)^4</math> |
− | \end{align*} | + | \end{align*} |
Therefore, <math>f(x)</math> must be 0 or <math>x^2</math>. | Therefore, <math>f(x)</math> must be 0 or <math>x^2</math>. |
Revision as of 19:49, 24 March 2015
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:
\begin{align*} $x^6f(x) &= x^4(-x)^2f(-(-x)) \\ &= x^4f(-x)^2 \\ &= f(x)^4$ (Error compiling LaTeX. Unknown error_msg) \end{align*}
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 .