gives the quotient of p and q, treated as polynomials in x, with any remainder dropped.

Details and Options

  • With the option Modulus->n, the quotient is computed modulo n.


open allclose all

Basic Examples  (1)

The quotient of by , with the remainder dropped:

Scope  (2)

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

PolynomialQuotient also works for rational functions:

Options  (1)

Modulus  (1)

Use a prime modulus:

Properties & Relations  (4)

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:

Possible Issues  (2)

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:

Introduced in 1988