Bezout 's theorem states that the remainder of the division of a polynomial on the binomial is equal to .
It is assumed that the coefficients of the polynomial are contained in some commutative ring with unity (for example, in the field of real or complex numbers ).
Content
Proof
Divide the polynomial with the remainder on the binomial :
Where - the remainder. Because then - a polynomial of degree not higher than 0, that is, a constant. Substituting , insofar as , we have .
Consequences
- Number is the root of the polynomial if and only if divides without remainder into a binomial (From this, in particular, it follows that the set of roots of the polynomial identical to the set of roots of the corresponding equation )
- The free term of the polynomial is divided by any integer root of the polynomial with integer coefficients (if the leading coefficient is 1, then all rational roots are integer).
- Let be Is the whole root of the reduced polynomial with integer coefficients. Then for any whole number divided by .
Applications
Bezout's theorem and its corollaries make it easy to find rational roots of polynomial equations with rational coefficients.
See also
- The main theorem of algebra