Highest Common Factor of 6924, 5628, 72179 using Euclid's algorithm

Created By : Jatin Gogia

Reviewed By : Rajasekhar Valipishetty

Last Updated : Apr 06, 2023

HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 6924, 5628, 72179 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 6924, 5628, 72179 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 6924, 5628, 72179 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 6924, 5628, 72179 is 1.

HCF(6924, 5628, 72179) = 1

HCF of 6924, 5628, 72179 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 6924, 5628, 72179 is 1.

Highest Common Factor of 6924,5628,72179 using Euclid's algorithm

Highest Common Factor of 6924,5628,72179 is 1

Step 1: Since 6924 > 5628, we apply the division lemma to 6924 and 5628, to get

6924 = 5628 x 1 + 1296

Step 2: Since the reminder 5628 ≠ 0, we apply division lemma to 1296 and 5628, to get

5628 = 1296 x 4 + 444

Step 3: We consider the new divisor 1296 and the new remainder 444, and apply the division lemma to get

1296 = 444 x 2 + 408

We consider the new divisor 444 and the new remainder 408,and apply the division lemma to get

444 = 408 x 1 + 36

We consider the new divisor 408 and the new remainder 36,and apply the division lemma to get

408 = 36 x 11 + 12

We consider the new divisor 36 and the new remainder 12,and apply the division lemma to get

36 = 12 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 6924 and 5628 is 12

Notice that 12 = HCF(36,12) = HCF(408,36) = HCF(444,408) = HCF(1296,444) = HCF(5628,1296) = HCF(6924,5628) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 72179 > 12, we apply the division lemma to 72179 and 12, to get

72179 = 12 x 6014 + 11

Step 2: Since the reminder 12 ≠ 0, we apply division lemma to 11 and 12, to get

12 = 11 x 1 + 1

Step 3: We consider the new divisor 11 and the new remainder 1, and apply the division lemma to get

11 = 1 x 11 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 12 and 72179 is 1

Notice that 1 = HCF(11,1) = HCF(12,11) = HCF(72179,12) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 6924, 5628, 72179 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 6924, 5628, 72179?

Answer: HCF of 6924, 5628, 72179 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6924, 5628, 72179 using Euclid's Algorithm?

Answer: For arbitrary numbers 6924, 5628, 72179 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.