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