On Determination of GCD of 𝑛 Integers

The greatest common divisor (GCD) of n number of integers a_1,a_2,…,a_n, not all zero, is the positive integer which divides all of them and is divisible by any common divisor of a_1,a_2,…,a_n. When n = 2, there are a number of algorithms available in literature which are used to determine the GCD of two integers. To determine the GCD of n > 2 integers, one applies the same repeatedly to derive the final answer. In this paper, some fruitful results along with techniques are discussed how to determine the GCD of n > 2 integers. Several important theorems along with their applications have been illustrated through examples to demonstrate the procedure. Keywords - GCD, Number Theory, Integers.