sadam.gcd
Compute the Greatest Common Divisor of two integers.
sadam.gcd will compute the Greatest Common Divisor of two integers. The GCD of two positive integers is the largest positive integer that divides the numbers without a remainder. If an incoming number is negative, the object will take its absolute value. For the case when an incoming number was 0, GCD returns the absolute value of the other incoming number. |
from the library : The sadam Library
Format : **External** Environment : **max** / **Max Runtime** / **msp**
**freeware** Max **5.x** / **6.x**
http://www.sadam.hu |