Number theoryDifficulty 7.1National olympiad, round 2Prove it
A polynomial P with integer coefficients has at least 13 distinct integer roots. Prove that if an integer n is not a root of P, then ∣P(n)∣≥7⋅6!2, and give an example for equality.
Solution
1. **Express the polynomial P(x) with its roots:** Since P has at least 13 distinct integer roots, we can write: P(x)=Q(x)k=1∏13(x−rk) where Q(x) is a polynomial with integer coefficients, and r1,r2,…,r13 are the distinct integer roots of P.
2. **Evaluate P(n) for an integer n that is not a root of P:** If n is not a root of P, then n is distinct from all rk. Therefore, we have: P(n)=Q(n)k=1∏13(n−rk) Since Q(n) is an integer, we need to focus on the product ∏k=113(n−rk).
3. **Estimate the minimum value of ∏k=113(n−rk):** To find the minimum value of ∏k=113(n−rk), consider the smallest possible values of ∣n−rk∣ for distinct rk. The smallest non-zero values for ∣n−rk∣ are 1,2,3,…,13.
4. Calculate the product of the smallest non-zero values: The product of the first 13 positive integers is: k=1∏13k=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=1∏6k)2⋅7=(1⋅2⋅3⋅4⋅5⋅6)2⋅7=(6!)2⋅7
5. **Verify the inequality ∣P(n)∣≥7⋅6!2:** Since Q(n) is an integer, the minimum value of ∣P(n)∣ when n is not a root of P is: ∣P(n)∣≥7⋅6!2
6. Provide an example for equality: Consider the polynomial: P(x)=(x+7)k=1∏6(x2−k2) This polynomial has roots at x=±1,±2,±3,±4,±5,±6, and x=−7. Evaluating P(0): P(0)=(0+7)k=1∏6(02−k2)=7⋅(−1)⋅(−4)⋅(−9)⋅(−16)⋅(−25)⋅(−36) Simplifying the product: P(0)=7⋅1⋅4⋅9⋅16⋅25⋅36=7⋅(6!)2 Thus, ∣P(0)∣=7⋅6!2.
■
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.