Skip to content

Mathematics · Ch 2 — Basic Algebra

Division Algorithm

2.6.1

Division Algorithm

Division algorithm. Given polynomials f(x)f(x) and a nonzero g(x)g(x), there exist unique polynomials q(x)q(x) (the quotient) and r(x)r(x) (the remainder) with

f(x)=q(x)g(x)+r(x),deg⁡r(x)<deg⁡g(x).f(x)=q(x)g(x)+r(x),\qquad \deg r(x)<\deg g(x).

If r(x)≡0r(x)\equiv0, then g(x)g(x) and q(x)q(x) are factors of f(x)f(x).

Special case g(x)=x−ag(x)=x-a. Here deg⁡r<1\deg r<1, so r(x)r(x) is just a constant cc: f(x)=(x−a)q(x)+cf(x)=(x-a)q(x)+c. Substituting x=ax=a gives c=f(a)c=f(a).

Remainder Theorem. If f(x)f(x) is divided by x−ax-a, the remainder is f(a)f(a). Hence f(a)=0f(a)=0 if and only if x−ax-a is a factor of f(x)f(x) -- this is the Factor Theorem.

Zeros and multiplicity. aa is a zero of f(x)f(x) if f(a)=0f(a)=0; then x−ax-a is a factor. If f(x)=(x−a)kg(x)f(x)=(x-a)^k g(x) with g(a)≠0g(a)\ne0, the exponent kk is the zero's multiplicity, and kk can never exceed deg⁡f\deg f.

Note

A degree-nn polynomial has at most nn distinct real zeros -- it can have fewer, and possibly none at all (e.g. P(x)=x2+1P(x)=x^2+1). If P(x)P(x) has rational coefficients and a+bpa+b\sqrt p (a,b∈Qa,b\in Q, pp prime) is a zero, then its conjugate a−bpa-b\sqrt p is automatically a zero too. …