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

GreatestCommonDivisor​(PeterO.​Numbers.​EInteger,​PeterO.​Numbers.​EInteger)

 Method (no overloads)

Summary

The greatest common divisor of a and b, never
negative, and 0 only when both are: what Gcd(PeterO.Numbers.EInteger) answers.

























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