Highest Common Factor of 5325, 6978, 83601 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 5325, 6978, 83601 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 5325, 6978, 83601 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 5325, 6978, 83601 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 5325, 6978, 83601 is 3.
HCF(5325, 6978, 83601) = 3
HCF of 5325, 6978, 83601 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5325, 6978, 83601 is 3.
Highest Common Factor of 5325,6978,83601 is 3
Step 1: Since 6978 > 5325, we apply the division lemma to 6978 and 5325, to get
6978 = 5325 x 1 + 1653
Step 2: Since the reminder 5325 ≠ 0, we apply division lemma to 1653 and 5325, to get
5325 = 1653 x 3 + 366
Step 3: We consider the new divisor 1653 and the new remainder 366, and apply the division lemma to get
1653 = 366 x 4 + 189
We consider the new divisor 366 and the new remainder 189,and apply the division lemma to get
366 = 189 x 1 + 177
We consider the new divisor 189 and the new remainder 177,and apply the division lemma to get
189 = 177 x 1 + 12
We consider the new divisor 177 and the new remainder 12,and apply the division lemma to get
177 = 12 x 14 + 9
We consider the new divisor 12 and the new remainder 9,and apply the division lemma to get
12 = 9 x 1 + 3
We consider the new divisor 9 and the new remainder 3,and apply the division lemma to get
9 = 3 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 5325 and 6978 is 3
Notice that 3 = HCF(9,3) = HCF(12,9) = HCF(177,12) = HCF(189,177) = HCF(366,189) = HCF(1653,366) = HCF(5325,1653) = HCF(6978,5325) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 83601 > 3, we apply the division lemma to 83601 and 3, to get
83601 = 3 x 27867 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 3 and 83601 is 3
Notice that 3 = HCF(83601,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 5325, 6978, 83601 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 5325, 6978, 83601?
Answer: HCF of 5325, 6978, 83601 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5325, 6978, 83601 using Euclid's Algorithm?
Answer: For arbitrary numbers 5325, 6978, 83601 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.