/**
 * Returns the subresultant pseudo remainder sequence of `a/b`.
 *
 * * **precondition:** `g !== []`, i.e. unequal to the zero polynomial.
 *
 * * see [*The subresultant polynomial remainder sequence algorithm* by Ruiyuan (Ronnie) Chen, p.10](https://pdfs.semanticscholar.org/2e6b/95ba84e2160748ba8fc310cdc408fc9bbade.pdf)
 *
 * @param f the polynomial a in the formula a = bq + r; the polynomial is given
 * with coefficients as a dense array of bigints from highest to lowest
 * power, e.g. `[5n,-3n,0n]` represents the  polynomial `5x^2 - 3x`
 * @param g the polynomial b in the formula a = bq + r;
 * @param sturm if set to true then calculate a Sturm sequence instead
 *
 * @doc
 */
declare function bPremSequenceSubresultant(f: bigint[], g: bigint[], sturm?: boolean): bigint[][];
export { bPremSequenceSubresultant };