b-gcd-prs
▸ function bGcdPrs
(a: bigint[], b: bigint[]): bigint[]
Defined in gcd/bigint/b-gcd-prs.ts:25
Heads up!
Use the modular gcd algorithm, [[gcdModular]] (still to be implemented 😢), instead - it is faster.
Returns the GCD (Greatest Common Divisor) of the two given polynomials using
Pseudo Remainder Sequences (PRSs) (bar overflow). The returned GCD is a
polynomial with coefficients given densely as an array of
bigints from highest to lowest power, e.g. [[5],[-3],[0]]
represents the polynomial 5x^2 - 3x.
Parameters:
| Name | Type | Description |
|---|---|---|
a | bigint[] | a polynomial with coefficients given densely as an array of bigints from highest to lowest power, e.g. [5n,-3n,0n] represents the polynomial 5x^2 - 3x |
b | bigint[] | another polynomial |
Returns: bigint[]