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