Are there any real life applications of the greatest common divisor of two or more integers?
I can't think of any real world applications. The closest I can think of is the Euclid algorithm for finding the GCD which can be extended and used to find the inverse of a number in finite field, but it's seldom used because there are other and better methods. For example, if the field isn't very large, a lookup table can be used. In the case of hardware implementations of inversion based on "binary" finite fields (which is part of AES encryption), there are complex methods (sub-field mapping) that involve fewer gates than a lookup table. Wiki article for extended Euclid algorithm:Are there any real life applications of the greatest common divisor of two or more integers?
Directly, I guess it's not really either.Wouldn't this be the "lowest common multiple" as opposed to the "greatest common divisor"?