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