Maths Olympiad Prep

Library / /333 of 520

Number theory Difficulty 7.1 National olympiad, round 2 Prove it

A polynomial PP with integer coefficients has at least 1313 distinct integer roots. Prove that if an integer nn is not a root of PP, then P(n)76!2|P(n)| \geq 7 \cdot 6!^2, and give an example for equality.

Solution

1. **Express the polynomial P(x) P(x) with its roots:**
Since P P has at least 13 distinct integer roots, we can write:
P(x)=Q(x)k=113(xrk) P(x) = Q(x) \prod_{k=1}^{13} (x - r_k)
where Q(x) Q(x) is a polynomial with integer coefficients, and r1,r2,,r13 r_1, r_2, \ldots, r_{13} are the distinct integer roots of P P .

2. **Evaluate P(n) P(n) for an integer n n that is not a root of P P :**
If n n is not a root of P P , then n n is distinct from all rk r_k . Therefore, we have:
P(n)=Q(n)k=113(nrk) P(n) = Q(n) \prod_{k=1}^{13} (n - r_k)
Since Q(n) Q(n) is an integer, we need to focus on the product k=113(nrk) \prod_{k=1}^{13} (n - r_k) .

3. **Estimate the minimum value of k=113(nrk) \left| \prod_{k=1}^{13} (n - r_k) \right| :**
To find the minimum value of k=113(nrk) \left| \prod_{k=1}^{13} (n - r_k) \right| , consider the smallest possible values of nrk |n - r_k| for distinct rk r_k . The smallest non-zero values for nrk |n - r_k| are 1,2,3,,13 1, 2, 3, \ldots, 13 .

4. Calculate the product of the smallest non-zero values:
The product of the first 13 positive integers is:
k=113k=13! \prod_{k=1}^{13} k = 13!
However, we need to consider the product of the squares of the first 6 positive integers and then multiply by 7, as given in the problem:
(k=16k)27=(123456)27=(6!)27 \left( \prod_{k=1}^{6} k \right)^2 \cdot 7 = (1 \cdot 2 \cdot 3 \cdot 4 \cdot 5 \cdot 6)^2 \cdot 7 = (6!)^2 \cdot 7

5. **Verify the inequality P(n)76!2 |P(n)| \geq 7 \cdot 6!^2 :**
Since Q(n) Q(n) is an integer, the minimum value of P(n) |P(n)| when n n is not a root of P P is:
P(n)76!2 |P(n)| \geq 7 \cdot 6!^2

6. Provide an example for equality:
Consider the polynomial:
P(x)=(x+7)k=16(x2k2) P(x) = (x + 7) \prod_{k=1}^{6} (x^2 - k^2)
This polynomial has roots at x=±1,±2,±3,±4,±5,±6 x = \pm 1, \pm 2, \pm 3, \pm 4, \pm 5, \pm 6 , and x=7 x = -7 . Evaluating P(0) P(0) :
P(0)=(0+7)k=16(02k2)=7(1)(4)(9)(16)(25)(36) P(0) = (0 + 7) \prod_{k=1}^{6} (0^2 - k^2) = 7 \cdot (-1) \cdot (-4) \cdot (-9) \cdot (-16) \cdot (-25) \cdot (-36)
Simplifying the product:
P(0)=7149162536=7(6!)2 P(0) = 7 \cdot 1 \cdot 4 \cdot 9 \cdot 16 \cdot 25 \cdot 36 = 7 \cdot (6!)^2
Thus, P(0)=76!2 |P(0)| = 7 \cdot 6!^2 .

\blacksquare

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.