Difference between revisions of "2014 USAMO Problems/Problem 1"
(→Solution) |
Mathboy282 (talk | contribs) (→Solution) |
||
(One intermediate revision by the same user not shown) | |||
Line 7: | Line 7: | ||
==Solution== | ==Solution== | ||
Using the hint we turn the equation into <math>\prod_{k=1} ^4 (x_k-i)(x_k+i) \implies P(i)P(-i) \implies (b-d-1)^2 + (a-c)^2 \implies \boxed{16}</math>. This minimum is achieved when all the <math>x_i</math> are equal to <math>1</math>. | Using the hint we turn the equation into <math>\prod_{k=1} ^4 (x_k-i)(x_k+i) \implies P(i)P(-i) \implies (b-d-1)^2 + (a-c)^2 \implies \boxed{16}</math>. This minimum is achieved when all the <math>x_i</math> are equal to <math>1</math>. | ||
+ | |||
+ | A more detailed version goes as follows: | ||
+ | |||
+ | Observe that <math>x^2+1=x^2-(-1)=x^2-i^2=(x-i)(x+i).</math> Now, notice that: | ||
+ | <cmath>\prod_{k=1} ^4 (x_k-i)(x_k+i)=\prod_{k=1}^4(x_k-i)\cdot\prod_{k=1}^4(x_k+i).</cmath> | ||
+ | The definition of <math>P(x)</math> is <math>(x-x_1)(x-x_2)(x-x_3)(x-x_4)</math> where the leading coeffecient is <math>1</math> since <math>P</math> is a monic polynomial as given in the problem. Then, substituting in <math>i,</math> we have: | ||
+ | <cmath>P(i)=(i-x_1)\cdots(i-x_4)=(-1)^4(x_1-i)\cdots(x_4-i).</cmath> | ||
+ | This is exactly our first product. Our second product can be found as follows: | ||
+ | <cmath>P(-i)=(-i-x_1)\cdots(-i-x_4)=(-1)^4(x_1+i)\cdots(x_4+i).</cmath> | ||
+ | Hence, what we want to find is <math>P(i)P(-i).</math> But substituting in <math>i</math> into our expressoin <math>x^4+ax^3+bx^2+cx+d</math> gets us <math>P(i)=(1-b+d)+(c-a)i,</math> and <math>P(-i)=(1-b+d)+(a-c)i.</math> Hence: | ||
+ | <cmath>P(i)P(-i)=((1-b+d)+(c-a)i)((1-b+d)+(a-c)i)=(1-b+d)^2-(a-c)^2=(-1)^2(b-d-1)^2-(a-c)^2 \ge 4^2 -0^2=16</cmath> | ||
+ | where equality holds at <math>a=c</math> and <math>b-d=5 \Rightarrow b=d+5.</math> Hence, the minimum is <math>\boxed{16}.</math> | ||
+ | |||
+ | To finish this off we find a construction for this minimum. We know that <math>a=c</math> and <math>b=d+5.</math> Hence | ||
+ | <cmath>P(x)=x^4+cx^3+(d+5)x^2+cx+d.</cmath> | ||
+ | We set <math>d=1</math> to get as much symmetry as possible within our polynomial. This leads to <math>x^4+cx^3+6x^2+cx+1.</math> However, note that <math>\binom{4}{2}=6</math> and <math>\binom{4}{0}=\binom{4}{4}=1,</math> so with some wishful thinking this leads us to think about the binomial theorem. We can try <math>(x\pm 1)^4</math> and realize that those solutions do work. | ||
+ | |||
+ | Hence, <math>16</math> is obtained when all of <math>x_i</math> are equal to <math>1</math> or all equal to <math>-1.</math> | ||
+ | |||
+ | ~mathboy282 |
Latest revision as of 21:58, 20 November 2024
Problem
Let be real numbers such that and all zeros and of the polynomial are real. Find the smallest value the product can take.
Hint
Factor as the product of two linear binomials.
Solution
Using the hint we turn the equation into . This minimum is achieved when all the are equal to .
A more detailed version goes as follows:
Observe that Now, notice that: The definition of is where the leading coeffecient is since is a monic polynomial as given in the problem. Then, substituting in we have: This is exactly our first product. Our second product can be found as follows: Hence, what we want to find is But substituting in into our expressoin gets us and Hence: where equality holds at and Hence, the minimum is
To finish this off we find a construction for this minimum. We know that and Hence We set to get as much symmetry as possible within our polynomial. This leads to However, note that and so with some wishful thinking this leads us to think about the binomial theorem. We can try and realize that those solutions do work.
Hence, is obtained when all of are equal to or all equal to
~mathboy282