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