Browse · MathNet
PrintVMO
Vietnam algebra
Problem
Consider 2 non-constant polynomials , with non-negative coefficients. The coefficients of is not larger than and has at least one coefficient larger than . Assume that and has a common rational root for some , . Prove that
Solution
Since the coefficients of are non-negative, the root must be negative. Without loss of generality, we assume that then . Let , then is an integer polynomial where is a root. This implies that where is a polynomial with rational coefficients. Since , by using Gauss lemma for the product of two primitive polynomials, we get . This implies that for all .
Hence, to finish the proof, we just need to show that for all . Since is a root of , we also can write in which is an polynomial with integer coefficients. Note that for all , so it suffices to show that for all .
By expanding the product in the right hand side, we can find out that the coefficient of is for and the constant is . On the other hand, since the coefficients of are not larger than then the coefficients of are not less than . From this, . Suppose that there exists some coefficients of are positive, denote by , the smallest value of such indices. Thus, and which implies that This contradiction show that all coefficients of is non-positive. But they can not all zero, otherwise but has at least one coefficient larger than . In conclusion, for all . Therefore, for .
Hence, to finish the proof, we just need to show that for all . Since is a root of , we also can write in which is an polynomial with integer coefficients. Note that for all , so it suffices to show that for all .
By expanding the product in the right hand side, we can find out that the coefficient of is for and the constant is . On the other hand, since the coefficients of are not larger than then the coefficients of are not less than . From this, . Suppose that there exists some coefficients of are positive, denote by , the smallest value of such indices. Thus, and which implies that This contradiction show that all coefficients of is non-positive. But they can not all zero, otherwise but has at least one coefficient larger than . In conclusion, for all . Therefore, for .
Techniques
Irreducibility: Rational Root Theorem, Gauss's Lemma, EisensteinPolynomial operationsGreatest common divisors (gcd)Factorization techniques