what :
Home > Objects > S > sadam.gcd > author : Adam Siska


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
Max 5.x / 6.x


4854 objects and 135 libraries within the database Last entries : May 4th, 2023 Last comments : 0 0 visitor and 13487320 members connected RSS
Site under GNU Free Documentation License