AngouriMath
GreatestCommonDivisor(AngouriMath.Entity.Number.Integer,AngouriMath.Entity.Number.Integer)
Method (no overloads)
Summary
Finds the greatest common divisor
of two integers
of two integers
Example
Console.WriteLine(MathS.NumberTheory.GreatestCommonDivisor(1872, 169));
Prints
13
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1534 pages online