- 198
- 2
Are there any real life applications of the greatest common divisor of two or more integers?
Aww go on - show us one... what's the one you use regularly that you last used?There are a whole bunch. I use the idea regularly so it is difficult to point to a specific thing...
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?
Wouldn't this be the "lowest common multiple" as opposed to the "greatest common divisor"?The store sells 8-packs of hotdogs and 12-packs of buns. If you want the same (nonzero) number of each, what's the cheapest way to do it?
Directly, I guess it's not really either.Wouldn't this be the "lowest common multiple" as opposed to the "greatest common divisor"?