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