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