IMO Training 2008 Polynomials Yufei Zhao

Polynomials
July 2, 2008
Yufei Zhao
[email protected]
1 Roots of unity
1. (USAMO 1976) The polynomials A(x), B(x), C(x), D(x) satisfy the equation
A(x
5
) + xB(x
5
) + x
2
C(x
5
) = (1 + x + x
2
+ x
3
+ x
4
)D(x).
Show that A(1) = 0.
2. A sequence a
1
, a
2
, . . . , a
n
is called k-balanced if a
1
+ a
k+1
+ = a
2
+ + a
k+2
+ = =
a
k
+a
2k
+ . Suppose the sequence a
1
, a
2
, . . . , a
50
is k-balanced for k = 3, 5, 7, 11, 13, 17. Prove
that all the values a
i
are zero.
3. Let P(x) be a monic polynomial with integer coecients such that all its zeros lie on the unit
circle. Show that all the zeros of P(x) are roots of unity, i.e., P(x)|(x
n
1)
k
for some n, k N.
2 Integer divisibility
The main lesson, as illustrated by the rst set of problems here, is that if P(x) has integer coecients,
then a b | P(a) P(b).
4. (a) (USAMO 1974) Let a, b, c be three distinct integers, and let P be a polynomial with integer
coecients. Show that in this case the conditions P(a) = b, P(b) = c, P(c) = a cannot be
satised simultaneously.
(b) Let P(x) be a polynomial with integer coecients, and let n be an odd positive integer. Sup-
pose that x
1
, x
2
, . . . , x
n
is a sequence of integers such that x
2
= P(x
1
), x
3
= P(x
2
), . . . , x
n
=
P(x
n1
), and x
1
= P(x
n
). Prove that all the x
i
s are equal.
1
(c) (Putnam 2000) Let f(x) be a polynomial with integer coecients. Dene a sequence
a
0
, a
1
, . . . of integers such that a
0
= 0 and a
n+1
= f(a
n
) for all n 0. Prove that if
there exists a positive integer m for which a
m
= 0 then either a
1
= 0 or a
2
= 0.
(d) (IMO 2006) Let P(x) be a polynomial of degree n > 1 with integer coecients and let k be
a positive integer. Consider the polynomial
Q(x) = P(P(. . . (P(x) . . . ))
. .
k P

s
Prove that there are at most n integers t such that Q(t) = t.
5. Let a, b, c be nonzero integers such that both
a
b
+
b
c
+
c
a
and
a
c
+
c
b
+
b
a
are integers. Prove that
|a| = |b| = |c|.
1
This problem appeared in Reid Bartons MOP handout in 2005. Compare with the IMO 2006 problem.
1
IMO Training 2008 Polynomials Yufei Zhao
6. (IMO Shortlist 2005) Let a, b, c, d, e and f be positive integers. Suppose that the sum S =
a + b + c + d + e + f divides both abc + def and ab + bc + ca de ef fd. Prove that S is
composite.
3 Crossing the x-axis
For any continuous function (e.g. polynomial) f, if f(a) and f(b) have dierent signs for some a < b,
then there must exist a t (a, b) such that f(t) = 0.
7. (China 1995) Alice and Bob play a game with a polynomial of degree at least 4:
x
2n
+x
2n1
+x
2n2
+ +x + 1.
They ll in real numbers to empty boxes in turn. If the resulting polynomial has no real root,
Alice wins; otherwise, Bob wins. If Alice goes rst, who has a winning strategy?
8. (USAMO 2002) Prove that any monic polynomial of degree n with real coecients is the average
of two monic polynomials of degree n with n real roots.
4 Lagrange and Chebyshev
Lagrange interpolation. If (x
1
, y
1
), . . . , (x
n
, y
n
) are points in the plane with distinct x-coordinates,
then there exists a unique polynomial P(x) of degree at most n 1 passing through these points, and
it is given by the expression
P(x) =
n

i=1
y
i

j=i
x x
j
x
i
x
j
.
You may have seen many problems that can be solved directly using interpolation (e.g., here are the
values of P(1), P(2), . . . , P(n), whats the value of P(n + 1)). The following problems require more
subtle uses of interpolation.
Chebyshev polynomials. These are polynomials satisfying
T
n
(cos ) = cos n.
One can show using induction T
n
is indeed a polynomial, and has integer coecients, with leading
coecient 2
n
. Chebyshev polynomials (including its variants) are often useful because they are nicely
bounded in [1, 1], so that they often serve as equality cases. Specically, we have
|T
n
(x)| 1, whenever x [1, 1].
Outside of [1, 1], the values of T
n
(x) can be found through T
n
_
1
2
_
x +
1
x
__
=
1
2
_
x
n
+
1
x
n
_
(why?).
A common variant of Chebyshev polynomials is the class of polynomials satisfying P
n
(2 cos ) =
2 cos n. One can show that P
n
(x) is a monic integer polynomial. It also satises P
n
(x+x
1
) = x
n
+x
n
.
9. Show that if f(x) is a monic polynomial of degree n1, and a
1
, a
2
, . . . , a
n
distinct real numbers,
then
n

i=1
f(a
i
)

j=i
(a
j
a
i
)
= 1
2
IMO Training 2008 Polynomials Yufei Zhao
10. (IMO Shortlist 1997) Let f be a polynomial with integer coecients and let p be a prime such
that f(0) = 0, f(1) = 1, and f(k) 0 or 1 (mod p) for all positive integers k. Show that
deg f p 1.
11. Let P be a polynomial of degree n with real coecients such that |f(x)| 1 for all x [0, 1].
Show that |f(
1
n
)| 2
n+1
1.
12. Let P(x) be a monic degree n polynomial with real coecients. Prove that there is some t [1, 1]
such that |P(t)|
1
2
n
.
13. (Walter Janous, Crux) Suppose that a
0
, a
1
, . . . , a
n
are real numbers such that for all x [1, 1],
|a
0
+ a
1
x + + a
n
x
n
| 1. Show that for all x [1, 1], |a
n
+ a
n1
x + + a
0
x
n
| 2
n1
14. Let x
1
, x
2
, . . . , x
n
, n 2, be n distinct real numbers in the interval [1, 1]. Prove that
1
t
1
+
1
t
2
+ +
1
t
n
2
n2
,
where t
i
=

j=i
|x
j
x
i
|.
5 Irreducibility through mods
In abstract algebra language, if A is a UFD (unique factorization domain), then so is A[x]. In particular,
elds are automatically UFDs, so that K[x] is a UFD whenever K is a eld. Useful examples of UFDs
include: Z[x], R[x], C[x], Z[x, y], F
p
[x].
The last example is especially worth mentioning. Yes, unique factorization holds even when the coef-
cients of the polynomial is considered in mod p (where p must be prime). This means that when we
are considering factorizations of integers polynomials f(x) = g(x)h(x), it may be helpful to reduce the
problem to

f(x) = g(x)

h(x), where the coecients are considered in mod p.

15. (a) (Eisensteins criterion) Let f(x) = a
n
x
n
+ a
n1
x
n1
+ + a
1
x + a
0
be a polynomial with
integer coecients such that p | a
i
for 0 i n 1, p a
n
and p
2
a
0
. Then f(x) is
irreducible.
(b) Let f(x) = a
n
x
n
+a
n1
x
n1
+ +a
1
x +a
0
be a polynomial with integer coecients such
that p | a
i
for 0 i nk, p a
k
and p
2
a
0
. Then f(x) has an irreducible factor of degree
greater than k.
16. Let p be a prime number. Prove that x
p1
+ x
p2
+ + 1 is irreducible. (This is the example
that follows every exposition of Eisensteins criterion.)
17. Let n be a positive integer. Prove that (x
2
+ x)
2
n
+ 1 is irreducible.
6 Irreducibility through roots
Interestingly enough, when trying to prove that a certain integer polynomial is irreducible, it can be
usual to examine its complex roots.
18. Let f(x) = a
n
x
n
+ a
n1
x
n
+ + a
1
x + a
0
be a polynomial with integer coecients, such that
|a
0
| is prime and
|a
0
| > |a
1
| +|a
2
| + +|a
n
|.
Show that f(x) is irreducible.
3
IMO Training 2008 Polynomials Yufei Zhao
19. Let P(x) = a
0
+ a
1
x + + a
n
x
n
, where 0 < a
0
a
1
a
n
are real numbers. Prove that
any complex zero of the polynomial satises |z| 1.
20. Let p be a prime. Prove that x
p1
+ 2x
p2
+ 3x
p3
+ + (p 1)x + p is irreducible.
21. (Cohns criterion) Suppose that p
n
p
n1
p
1
p
0
is the base-10 representation of a prime number
p, with 0 p
i
< 10 for each i and p
n
= 0. Show that the polynomial
f(x) = p
n
x
n
+ p
n1
x
n
+ + p
1
x + p
0
is irreducible.
22. (Romania TST 2003) Let f(x) Z[x] be an irreducible monic polynomial with integer coecients.
Suppose that |f(0)| is not a perfect square. Show that f(x
2
) is also irreducible.
7 Rouches theorem (optional)
The following theorem from complex analysis can be useful in locating the zeros of a polynomial.
Theorem (Rouche). Let f and g be analytic functions (e.g. polynomials) on and inside a simple closed
curve C (e.g. a circle). Suppose that |f(z)| > |g(z)| for all points z on C. Then f and f g have the
same number of zeros (counting multiplicities) interior to C.
23. Let P(z) = a
n
z
n
+a
n1
z
n1
+ +a
1
z +a
0
be a polynomial with complex coecients, and such
that
|a
k
| > |a
0
| +|a
1
| + +|a
k1
| +|a
k+1
| + +|a
n
|
for some 0 k n. Show that exactly k zeros of P lie strictly inside the unit circle, and the
other n k zeros of P lie strictly outside the unit circle.
24. (Perrons criterion) Let P(x) = x
n
+a
n1
x
n1
+ +a
1
x +a
0
be a polynomial with a
0
= 0 and
|a
n1
| > 1 +|a
n2
| + +|a
1
| +|a
0
|.
Then P(x) is irreducible.
25. (IMO 1993) Let f(x) = x
n
+ 5x
n1
+ 3, where n > 1 is an integer. Prove that f(x) cannot be
expressed as the product of two nonconstant polynomials with integer coecients.
26. (Romania ??) Let f C[x] be a monic polynomial. Prove that we can nd a z C such that
|z| = 1 and |f(z)| 1.
4