Highest Common Factor of 5474, 9988 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 5474, 9988 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 5474, 9988 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 5474, 9988 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 5474, 9988 is 2.
HCF(5474, 9988) = 2
HCF of 5474, 9988 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5474, 9988 is 2.
Highest Common Factor of 5474,9988 is 2
Step 1: Since 9988 > 5474, we apply the division lemma to 9988 and 5474, to get
9988 = 5474 x 1 + 4514
Step 2: Since the reminder 5474 ≠ 0, we apply division lemma to 4514 and 5474, to get
5474 = 4514 x 1 + 960
Step 3: We consider the new divisor 4514 and the new remainder 960, and apply the division lemma to get
4514 = 960 x 4 + 674
We consider the new divisor 960 and the new remainder 674,and apply the division lemma to get
960 = 674 x 1 + 286
We consider the new divisor 674 and the new remainder 286,and apply the division lemma to get
674 = 286 x 2 + 102
We consider the new divisor 286 and the new remainder 102,and apply the division lemma to get
286 = 102 x 2 + 82
We consider the new divisor 102 and the new remainder 82,and apply the division lemma to get
102 = 82 x 1 + 20
We consider the new divisor 82 and the new remainder 20,and apply the division lemma to get
82 = 20 x 4 + 2
We consider the new divisor 20 and the new remainder 2,and apply the division lemma to get
20 = 2 x 10 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 5474 and 9988 is 2
Notice that 2 = HCF(20,2) = HCF(82,20) = HCF(102,82) = HCF(286,102) = HCF(674,286) = HCF(960,674) = HCF(4514,960) = HCF(5474,4514) = HCF(9988,5474) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 5474, 9988 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 5474, 9988?
Answer: HCF of 5474, 9988 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5474, 9988 using Euclid's Algorithm?
Answer: For arbitrary numbers 5474, 9988 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.