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