sicmutils.polynomial-gcd — io.samritchie/sicmutils 0.13.0-SNAPSHOT

*poly-gcd-cache-enable* clj/s

*poly-gcd-debug* clj/s

*poly-gcd-time-limit* clj/s

gcd clj/s

(gcd u v)

Knuth's algorithm 4.6.1E. This can take a long time, unfortunately, and so we bail if it seems to be taking too long.

gcd-continuation-chain clj/s macro

(gcd-continuation-chain u v & fs)

Takes two polynomials and a chain of functions. Each function, except the last, should have signature [p q k] where p and q are polynomials and k is a continuation of the same type. The last function should have signature [p q], without a continuation argument, since there's nowhere to go from there.

gcd-seq clj/s

Compute the GCD of a sequence of polynomials (we take care to break early if the gcd of an initial segment is unity)

gcd-stats clj/s

(gcd-stats)

primitive-gcd clj/s

(primitive-gcd xs)

A function which will return the gcd of a sequence of numbers.