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