- #1
matqkks
- 285
- 5
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?rexregisanimi said: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:matqkks said: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"?economicsnerd said: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?
rcgldr said:Wouldn't this be the "lowest common multiple" as opposed to the "greatest common divisor"?
A greatest common divisor, also known as a greatest common factor, is the largest number that divides evenly into two or more numbers. It is denoted as GCD(a, b) where a and b are the numbers being considered.
The easiest way to find the greatest common divisor is to list out all the factors of the numbers being considered and then find the largest number that appears in all of these lists. Another method is to use the Euclidean algorithm, which involves repeatedly dividing the larger number by the smaller number until the remainder is 0.
The greatest common divisor is the largest number that divides evenly into two or more numbers, while the least common multiple is the smallest number that is a multiple of two or more numbers. In other words, the GCD is a divisor of the numbers, while the LCM is a multiple of the numbers.
The greatest common divisor is useful in many mathematical and practical applications. It is commonly used in simplifying fractions, finding equivalent fractions, and solving certain types of equations. It can also be used in real-life scenarios, such as determining the smallest amount of material needed to evenly divide into a given number of objects.
No, the greatest common divisor is always a positive number. This is because it is a common divisor of two or more numbers, and negative numbers cannot be divided evenly into positive numbers. If one or both of the numbers being considered is negative, the greatest common divisor is still positive.