AngouriMath

Navigation

Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug ~~Donate~~ Contacts

TryBezout(AngouriMath.Functions.RationalPolynomial,AngouriMath.Functions.RationalPolynomial,AngouriMath.Functions.RationalPolynomial@,AngouriMath.Functions.RationalPolynomial@)

Method (no overloads)

Summary

left and right being coprime, the pair with
u*left + v*right = 1. false where they share a factor of
positive degree, or where either is zero.

Remarks

The extended Euclidean algorithm, which over a field ends at a constant remainder
exactly when the two are coprime — so the test for coprimality and the cofactors
come out of the same run and neither is asserted separately.

AngouriMath

Table of contents

AngouriMath

TryBezout​(AngouriMath.​Functions.​RationalPolynomial,​AngouriMath.​Functions.​RationalPolynomial,​AngouriMath.​Functions.​RationalPolynomial@,​AngouriMath.​Functions.​RationalPolynomial@)

TryBezout(AngouriMath.Functions.RationalPolynomial,AngouriMath.Functions.RationalPolynomial,AngouriMath.Functions.RationalPolynomial@,AngouriMath.Functions.RationalPolynomial@)