Vocabulary

math.polynomials

Inputs

Outputs

Word description

Computes the greatest common divisor d of p and q, and another value a satisfying:

Notes

GCD in the case of polynomials is a monic polynomial of the highest possible degree that divides into both p and q.

Examples

Definition

math.polynomials

Inputs

p | a polynomial |

q | a polynomial |

Outputs

a | a polynomial |

d | a polynomial |

Word description

Computes the greatest common divisor d of p and q, and another value a satisfying:

a*q = d mod p

Notes

GCD in the case of polynomials is a monic polynomial of the highest possible degree that divides into both p and q.

Examples

USING: kernel math.polynomials prettyprint ;
{ 1 1 1 1 } { 1 1 } pgcd [ . ] bi@

{ 0 0 } { 1 1 }

{ 0 0 } { 1 1 }

Definition

This documentation was generated offline from a
`load-all`

image. If you want, you can also
browse the documentation from within the UI developer tools. See
the Factor website
for more information.

Factor 0.100 x86.64 (2270, heads/master-9a858f779b, Jun 12 2024 16:13:38)