Module polynomial_division 

Polynomial long division operations

Implements polynomial division algorithms for univariate polynomials, supporting the Euclidean GCD algorithm and general polynomial arithmetic.

Algorithm

Uses IntPoly fast-path for univariate integer polynomials (primary path). Falls back to symbolic polynomial division for rational coefficient cases.

Example

use mathhook_core::{expr, symbol};
use mathhook_core::algebra::polynomial_division::polynomial_div;

let x = symbol!(x);
let (quotient, remainder) = polynomial_div(&expr!((x^2) - 1), &expr!(x - 1), &x);

Functions

polynomial_div

Polynomial long division

polynomial_quo

Polynomial quotient (division without remainder)

polynomial_rem

Polynomial remainder