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 7868, 9920 i.e. 4 the largest integer that leaves a remainder zero for all numbers.
HCF of 7868, 9920 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 7868, 9920 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 7868, 9920 is 4.
HCF(7868, 9920) = 4
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 7868, 9920 is 4.
Step 1: Since 9920 > 7868, we apply the division lemma to 9920 and 7868, to get
9920 = 7868 x 1 + 2052
Step 2: Since the reminder 7868 ≠ 0, we apply division lemma to 2052 and 7868, to get
7868 = 2052 x 3 + 1712
Step 3: We consider the new divisor 2052 and the new remainder 1712, and apply the division lemma to get
2052 = 1712 x 1 + 340
We consider the new divisor 1712 and the new remainder 340,and apply the division lemma to get
1712 = 340 x 5 + 12
We consider the new divisor 340 and the new remainder 12,and apply the division lemma to get
340 = 12 x 28 + 4
We consider the new divisor 12 and the new remainder 4,and apply the division lemma to get
12 = 4 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 4, the HCF of 7868 and 9920 is 4
Notice that 4 = HCF(12,4) = HCF(340,12) = HCF(1712,340) = HCF(2052,1712) = HCF(7868,2052) = HCF(9920,7868) .
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 7868, 9920?
Answer: HCF of 7868, 9920 is 4 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 7868, 9920 using Euclid's Algorithm?
Answer: For arbitrary numbers 7868, 9920 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.