powered by
Calculate the greatest common divisor between two numbers
gcd(a, b)
the greatest common divisor between a and b
a is greater than 0 while a is whole number
b is greater than 0 while b is whole number
OuYang Ming
Ues Euclidean algorithm
Friedrich Leisch, 2008 Creating R packages: A Tutorial Zhang Jinlong, How to create R package under Windows FAQ in R-PROJECT
a=14 b=32 c=gcd(a,b)
Run the code above in your browser using DataLab