Difference between revisions of "1971 IMO Problems/Problem 1"
Line 78: | Line 78: | ||
in the problem is <math>E_n = P'(a_1) + \cdots + P'(a_n)</math>, where <math>P'(x)</math> is | in the problem is <math>E_n = P'(a_1) + \cdots + P'(a_n)</math>, where <math>P'(x)</math> is | ||
the derivative of <math>P(x)</math>. (This is easy to see by calculating <math>P'(x)</math> | the derivative of <math>P(x)</math>. (This is easy to see by calculating <math>P'(x)</math> | ||
− | + | when <math>P(x)</math> is written as a product rather than as a sum of powers of | |
+ | <math>x</math>.) | ||
+ | |||
The graph of <math>P(x)</math> as <math>x</math> goes from <math>-\infty</math> to <math>\infty</math> crosses the | The graph of <math>P(x)</math> as <math>x</math> goes from <math>-\infty</math> to <math>\infty</math> crosses the | ||
− | <math>x</math>-axis at every root <math>a_k</math> | + | <math>x</math>-axis, or is tangent to the <math>x</math>-axis at every root <math>a_k</math>. If the |
− | + | graph is tangent to the <math>x</math>-axis, it crosses it, or it stays in the | |
− | depending on the multiplicity of the root. At a simple root <math>P'(a_k) | + | same half plane, depending on the multiplicity of the root. At a simple |
− | + | root <math>a_k, P'(a_k) > 0</math> or <math>P'(a_k) < 0</math> depending on the direction of | |
− | <math>a_k</math>. At a multiple root <math>a_k = \cdots = a_{k+p} | + | the graph of <math>P(x)</math> at <math>a_k</math>. At a multiple root |
− | and the graph of <math>P(x)</math> crosses the <math>x</math>-axis or not, depending on <math>p</math>. | + | <math>a_k = \cdots = a_{k+p}, P'(a_k) = 0</math>, and the graph of <math>P(x)</math> crosses |
+ | the <math>x</math>-axis or not, depending on <math>p</math> being odd or even. | ||
This way of looking at the problem makes it very easy to find examples | This way of looking at the problem makes it very easy to find examples | ||
− | which prove the problem for <math>n</math> even, or <math>n \ge 7</math> odd, because we would | + | which prove the problem for <math>n</math> even, or <math>n \ge 7</math> and odd, because we |
− | be looking for polynomials whose graph crosses the <math>x</math>-axis once from | + | would be looking for polynomials whose graph crosses the <math>x</math>-axis once |
− | + | from the upper half plane to the lower half plane at a simple root | |
− | tangent to the <math>x</math>-axis at all the other roots. See the picture below | + | <math>a_k</math> (thus making <math>P'(a_k) < 0</math>), and is tangent to the <math>x</math>-axis at |
− | for images showing the graphs of such polynomials. | + | all the other roots. See the picture below for images showing the |
+ | graphs of such polynomials. | ||
[[File:prob_1971_1.png|600px]] | [[File:prob_1971_1.png|600px]] | ||
− | (Wichking makes | + | (Wichking makes essentially the same remarks on |
https://aops.com/community/p366761.) | https://aops.com/community/p366761.) | ||
Latest revision as of 16:32, 20 December 2024
Problem
Prove that the following assertion is true for and
, and that it is false for every other natural number
If are arbitrary real numbers, then
Solution
Denote the expression in the problem, and denote
the statement
that
.
Take , and the remaining
. Then
for
even.
So the proposition is false for even
.
Suppose and odd. Take any
, and let
,
,
and
.
Then
.
So the proposition is false for odd
.
Assume .
Then in
the sum of the first two terms is non-negative, because
.
The last term is also non-negative.
Hence
, and the proposition is true for
.
It remains to prove .
Suppose
.
Then the sum of the first two terms in
is
.
The third term in is non-negative (the first two factors are non-positive and the last two non-negative).
The sum of the last two terms in is:
.
Hence .
This solution was posted and copyrighted by e.lopes. The original thread can be found here: [1]
Remarks (added by pf02, December 2024)
1. As a public service, I fixed a few typos in the solution above.
2. Make the solution a little more complete:
2.1. Let us note that the assumptions in case
and
in case
are perfectly legitimate. A different ordering of these numbers
could be reduced to this case by a simple change of notation: we
would substitute
by
with the indexes for the
's chosen
in such a way that the inequalities above are true for the
's.
2.2. The inequality
is true because
, and
.
To see this latter inequality, just notice that
,
and similarly for the other pairs of factors. The difference of the products
is
as desired.
The argument for the sum of the last two terms in is similar.
3. The case is very easy to prove in a different way. Note
that
I could not find an identity which would give such a simple proof
in the case .
4. By looking at the proof above, we can also see that for
we have equality if and only if
. For
,
assuming that
, we
have equality if and only if
and
,
or
and
.
5. If we denote , then the expression
in the problem is
, where
is
the derivative of
. (This is easy to see by calculating
when
is written as a product rather than as a sum of powers of
.)
The graph of as
goes from
to
crosses the
-axis, or is tangent to the
-axis at every root
. If the
graph is tangent to the
-axis, it crosses it, or it stays in the
same half plane, depending on the multiplicity of the root. At a simple
root
or
depending on the direction of
the graph of
at
. At a multiple root
, and the graph of
crosses
the
-axis or not, depending on
being odd or even.
This way of looking at the problem makes it very easy to find examples
which prove the problem for even, or
and odd, because we
would be looking for polynomials whose graph crosses the
-axis once
from the upper half plane to the lower half plane at a simple root
(thus making
), and is tangent to the
-axis at
all the other roots. See the picture below for images showing the
graphs of such polynomials.
(Wichking makes essentially the same remarks on https://aops.com/community/p366761.)
See Also
1971 IMO (Problems) • Resources | ||
Preceded by First Question |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |