gcd: Greatest common divisor
In AkselA/R-ymse: Ymse (Various)

Find the largest integer, that when two numbers are divided by it, returns an integer in both cases

gcd(x, y)

x, y

integers whose greates common divisor is to be found

1	gcd(sequence(10:16), rep(10:16, 10:16))

AkselA/R-ymse documentation built on March 21, 2020, 9:52 a.m.

AkselA/R-ymse index

README.md

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

Description