Uses Euclid's method of recursively computing the GCF (the GCF of two numbers is the same as the GCF of the smaller and the remainder (modula) of the larger divided by the smaller; and by definition, the GCF of any number and 0 is the number)
Note that the lowest common multiple of two numbers is their product divided by their GCF. In otherwords:
LCM(A, B) = A * B / GCF(A,B)
Note: these functions are not guaranteed
or supported by BrianDunning.com. Please contact the individual
developer with any questions or problems.
The premiere class for Lasso 8 and Lasso Studio with FileMaker Server 7 Advanced, coming soon to a city near you. Click
here.
Custom Function Authors:
Link to all of your own custom functions on this site with the following URL:
http://www.briandunning.com/filemaker-custom-functions/results.php?author=Your
Name Here