Highest Common Factor of 792, 612, 388 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 792, 612, 388 i.e. 4 the largest integer that leaves a remainder zero for all numbers.
HCF of 792, 612, 388 is 4 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 792, 612, 388 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 792, 612, 388 is 4.
HCF(792, 612, 388) = 4
HCF of 792, 612, 388 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 792, 612, 388 is 4.
Highest Common Factor of 792,612,388 is 4
Step 1: Since 792 > 612, we apply the division lemma to 792 and 612, to get
792 = 612 x 1 + 180
Step 2: Since the reminder 612 ≠ 0, we apply division lemma to 180 and 612, to get
612 = 180 x 3 + 72
Step 3: We consider the new divisor 180 and the new remainder 72, and apply the division lemma to get
180 = 72 x 2 + 36
We consider the new divisor 72 and the new remainder 36, and apply the division lemma to get
72 = 36 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 36, the HCF of 792 and 612 is 36
Notice that 36 = HCF(72,36) = HCF(180,72) = HCF(612,180) = HCF(792,612) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 388 > 36, we apply the division lemma to 388 and 36, to get
388 = 36 x 10 + 28
Step 2: Since the reminder 36 ≠ 0, we apply division lemma to 28 and 36, to get
36 = 28 x 1 + 8
Step 3: We consider the new divisor 28 and the new remainder 8, and apply the division lemma to get
28 = 8 x 3 + 4
We consider the new divisor 8 and the new remainder 4, and apply the division lemma to get
8 = 4 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 36 and 388 is 4
Notice that 4 = HCF(8,4) = HCF(28,8) = HCF(36,28) = HCF(388,36) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 792, 612, 388 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 792, 612, 388?
Answer: HCF of 792, 612, 388 is 4 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 792, 612, 388 using Euclid's Algorithm?
Answer: For arbitrary numbers 792, 612, 388 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.