AngouriMath

Symbolics for .NET


Table of contents

AngouriMath

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

← Back to list of members

Gcd​(AngouriMath.​Functions.​PrimeFieldPolynomial)

 Method (no overloads)

Summary

The monic greatest common divisor. Zero exactly when both are zero; otherwise
gcd(f, 0) is f made monic, and gcd(f, f) likewise.

























Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online