Highest Common Factor of 792, 672, 792, 468 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, 672, 792, 468 i.e. 12 the largest integer that leaves a remainder zero for all numbers.
HCF of 792, 672, 792, 468 is 12 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, 672, 792, 468 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, 672, 792, 468 is 12.
HCF(792, 672, 792, 468) = 12
HCF of 792, 672, 792, 468 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, 672, 792, 468 is 12.
Highest Common Factor of 792,672,792,468 is 12
Step 1: Since 792 > 672, we apply the division lemma to 792 and 672, to get
792 = 672 x 1 + 120
Step 2: Since the reminder 672 ≠ 0, we apply division lemma to 120 and 672, to get
672 = 120 x 5 + 72
Step 3: We consider the new divisor 120 and the new remainder 72, and apply the division lemma to get
120 = 72 x 1 + 48
We consider the new divisor 72 and the new remainder 48,and apply the division lemma to get
72 = 48 x 1 + 24
We consider the new divisor 48 and the new remainder 24,and apply the division lemma to get
48 = 24 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 24, the HCF of 792 and 672 is 24
Notice that 24 = HCF(48,24) = HCF(72,48) = HCF(120,72) = HCF(672,120) = HCF(792,672) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 792 > 24, we apply the division lemma to 792 and 24, to get
792 = 24 x 33 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 24, the HCF of 24 and 792 is 24
Notice that 24 = HCF(792,24) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 468 > 24, we apply the division lemma to 468 and 24, to get
468 = 24 x 19 + 12
Step 2: Since the reminder 24 ≠ 0, we apply division lemma to 12 and 24, to get
24 = 12 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 24 and 468 is 12
Notice that 12 = HCF(24,12) = HCF(468,24) .
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, 672, 792, 468 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, 672, 792, 468?
Answer: HCF of 792, 672, 792, 468 is 12 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 792, 672, 792, 468 using Euclid's Algorithm?
Answer: For arbitrary numbers 792, 672, 792, 468 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.