The function ggT calculates the greatest common divisor of two
natural numbers. In this package it is called by the function
kgV
which calculates the least common multiple of
two natural numbers. The latter is needed by the function
zykloid
and by the function npeaks
which calculates the number of peaks (or loops) a cycloid has.
As the greatest common divisor might be useful for other
purposes, the function ggT is accessible to external use in this
package.
1  ggT(a, b)

a 
A natural number (integer value > 0) 
b 
A natural number (integer value > 0) 
A natural number if a and b are natural numbers. In any other case, the function returns NA.
Peter Biber
Bronstein IN, Semendjaev KA, Musiol G, Muehlig H (2001): Taschenbuch der
Mathematik, 5th Edition, Verlag Harri Deutsch, 1186 p. (p. 333)
http://en.wikipedia.org/wiki/Euclidean_algorithm
kgV
, npeaks
1 2 3 4 5 6 7 8 
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
All documentation is copyright its authors; we didn't write any of that.