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 972, 606, 996, 848 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 972, 606, 996, 848 is 2 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 972, 606, 996, 848 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 972, 606, 996, 848 is 2.
HCF(972, 606, 996, 848) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 972, 606, 996, 848 is 2.
Step 1: Since 972 > 606, we apply the division lemma to 972 and 606, to get
972 = 606 x 1 + 366
Step 2: Since the reminder 606 ≠ 0, we apply division lemma to 366 and 606, to get
606 = 366 x 1 + 240
Step 3: We consider the new divisor 366 and the new remainder 240, and apply the division lemma to get
366 = 240 x 1 + 126
We consider the new divisor 240 and the new remainder 126,and apply the division lemma to get
240 = 126 x 1 + 114
We consider the new divisor 126 and the new remainder 114,and apply the division lemma to get
126 = 114 x 1 + 12
We consider the new divisor 114 and the new remainder 12,and apply the division lemma to get
114 = 12 x 9 + 6
We consider the new divisor 12 and the new remainder 6,and apply the division lemma to get
12 = 6 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 972 and 606 is 6
Notice that 6 = HCF(12,6) = HCF(114,12) = HCF(126,114) = HCF(240,126) = HCF(366,240) = HCF(606,366) = HCF(972,606) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 996 > 6, we apply the division lemma to 996 and 6, to get
996 = 6 x 166 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 6 and 996 is 6
Notice that 6 = HCF(996,6) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 848 > 6, we apply the division lemma to 848 and 6, to get
848 = 6 x 141 + 2
Step 2: Since the reminder 6 ≠ 0, we apply division lemma to 2 and 6, to get
6 = 2 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 6 and 848 is 2
Notice that 2 = HCF(6,2) = HCF(848,6) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 972, 606, 996, 848?
Answer: HCF of 972, 606, 996, 848 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 972, 606, 996, 848 using Euclid's Algorithm?
Answer: For arbitrary numbers 972, 606, 996, 848 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.