# Write a C program to find GCD(HCF) of N numbers using Arrays

By | March 6, 2017

# C program to find HCF of N numbers

### Greatest Common Divisor

In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that is a divisor of both numbers. For example, the GCD of 8 and 12 is 4.

The greatest common divisor is also known as the greatest common factor (gcf), highest common factor (hcf), greatest common measure (gcm), or highest common divisor.

Related Post : : C program to calculate the GCD(HCF) of number

## Example :

What is the greatest common divisor of 54 and 24?

The number 54 can be expressed as a product of two integers in several different ways: Thus the divisors of 54 are: 1, 2, 3, 6, 9, 18, 27, 54

Similarly, the divisors of 24 are: 1, 2, 3, 4, 6, 8, 12, 24

The numbers that these two lists share in common are the common divisors of 54 and 24:

1, 2, 3, 6 .

The greatest of these is 6. That is, the greatest common divisor of 54 and 24. One writes: Here below is the source code of the C program to find HCF of N numbers using Arrays.The program is successfully compile and run(on Codeblocks) on the windows system and produce output below :

### OUTPUT : :

Related : : C Program to find GCD of a number using recursion

## One thought on “Write a C program to find GCD(HCF) of N numbers using Arrays”

1. Nithi

else
{
gcd=arr[j]%gcd;
i++;
}

no need to use i++