Highest Common Factor of 912, 552, 160 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 912, 552, 160 i.e. 8 the largest integer that leaves a remainder zero for all numbers.
HCF of 912, 552, 160 is 8 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 912, 552, 160 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 912, 552, 160 is 8.
HCF(912, 552, 160) = 8
HCF of 912, 552, 160 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 912, 552, 160 is 8.
Highest Common Factor of 912,552,160 is 8
Step 1: Since 912 > 552, we apply the division lemma to 912 and 552, to get
912 = 552 x 1 + 360
Step 2: Since the reminder 552 ≠ 0, we apply division lemma to 360 and 552, to get
552 = 360 x 1 + 192
Step 3: We consider the new divisor 360 and the new remainder 192, and apply the division lemma to get
360 = 192 x 1 + 168
We consider the new divisor 192 and the new remainder 168,and apply the division lemma to get
192 = 168 x 1 + 24
We consider the new divisor 168 and the new remainder 24,and apply the division lemma to get
168 = 24 x 7 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 24, the HCF of 912 and 552 is 24
Notice that 24 = HCF(168,24) = HCF(192,168) = HCF(360,192) = HCF(552,360) = HCF(912,552) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 160 > 24, we apply the division lemma to 160 and 24, to get
160 = 24 x 6 + 16
Step 2: Since the reminder 24 ≠ 0, we apply division lemma to 16 and 24, to get
24 = 16 x 1 + 8
Step 3: We consider the new divisor 16 and the new remainder 8, and apply the division lemma to get
16 = 8 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 8, the HCF of 24 and 160 is 8
Notice that 8 = HCF(16,8) = HCF(24,16) = HCF(160,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 912, 552, 160 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 912, 552, 160?
Answer: HCF of 912, 552, 160 is 8 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 912, 552, 160 using Euclid's Algorithm?
Answer: For arbitrary numbers 912, 552, 160 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.