The quotient of two polynomials:

The degree of the remainder is less than the degree of the divisor:

The quotient of by , with the remainder dropped:

If the degree of the dividend is less than the degree of the divisor, then the quotient is zero:

The resulting polynomial will have coefficients that are rational expressions of input coefficients:

Polynomial quotient over the integers modulo :

Polynomial quotient over a finite field:

PolynomialQuotient also works for rational functions:

The quotient and remainder of division of by are and , where :

and are uniquely determined by the condition that the degree of is less than the degree of :

When the divisor divides the dividend , then the quotient of by satisfies :

Use PolynomialGCD to check that divides :

Verify that :

In general, the quotient of by satisfies :

The degree of the remainder is less than the degree of :

Factor a polynomial by finding one root at a time:

Take a quotient by the first factor:

Find another root and compute the quotient:

Verify the obtained factorization:

For a polynomial f, f==gq+r, where r is given by PolynomialRemainder:

Use Expand to verify identity:

To get both quotient and remainder use PolynomialQuotientRemainder:

PolynomialReduce generalizes PolynomialQuotient for multivariate polynomials:

Use PolynomialGCD to find a common divisor:

Use PolynomialQuotient to see the resulting factorization:

For rational functions common divisors are not automatically canceled:

Cancel effectively uses PolynomialQuotient to cancel common divisors:

The Cyclotomic polynomials are defined as quotients:

The result depends on what is assumed to be a variable:

The result from PolynomialQuotient depends on recognizing zeros:

This is a hidden zero:

The result is as if the hidden zero was not zero: