e-prem-sequence-primitive

▸ function ePremSequencePrimitive (f: number[][], g: number[][]): number[][][]

Defined in euclidean-division-related/expansion/e-prem-sequence-primitive.ts:23

Returns the primitive pseudo remainder sequence of a/b.

• precondition: g !== [], i.e. unequal to the zero polynomial.

• see Primitive Pseudo-remainder sequences

Parameters:

Name	Type	Description
f	number[][]	the polynomial a in the formula a = bq + r; the polynomial is given with coefficients as a dense array of Shewchuk expansions from highest to lowest power, e.g. [[5],[-3],[0]] represents the polynomial 5x^2 - 3x
g	number[][]	the polynomial b in the formula a = bq + r;

Returns: number[][][]