gcd: Finds the greatest (positive) common divisor of two integers.
In sqyu/genscore: Generalized Score Matching Estimators

Finds the greatest (positive) common divisor of two integers; if one of them is 0, returns the absolute value of the other number.

gcd(a, b)

`a`	An integer.
`b`	An integer.

The greatest (positive) common divisor of two integers; if one of them is 0, returns the absolute value of the other number.

gcd(1, 2)
gcd(1, -2)
gcd(12, -18)
gcd(-12, 18)
gcd(15, 0)
gcd(0, -15)
gcd(0, 0)

sqyu/genscore documentation built on April 30, 2020, 4:27 a.m.

sqyu/genscore index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description