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