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