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