gcd {FRACTION}

Greatest common divisor

Description

Calculate the greatest common divisor between two numbers

Usage

gcd(a, b)

Arguments

a

a is greater than 0 while a is whole number

b

b is greater than 0 while b is whole number

Details

Ues Euclidean algorithm

Value

the greatest common divisor between a and b

Author(s)

OuYang Ming

References

Friedrich Leisch, 2008 Creating R packages: A Tutorial Zhang Jinlong, How to create R package under Windows FAQ in R-PROJECT

Examples

a=14
b=32
c=gcd(a,b)