Highest Common Factor of 1009, 1392 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 1009, 1392 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 1009, 1392 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 1009, 1392 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 1009, 1392 is 1.
HCF(1009, 1392) = 1
HCF of 1009, 1392 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 1009, 1392 is 1.
Highest Common Factor of 1009,1392 is 1
Step 1: Since 1392 > 1009, we apply the division lemma to 1392 and 1009, to get
1392 = 1009 x 1 + 383
Step 2: Since the reminder 1009 ≠ 0, we apply division lemma to 383 and 1009, to get
1009 = 383 x 2 + 243
Step 3: We consider the new divisor 383 and the new remainder 243, and apply the division lemma to get
383 = 243 x 1 + 140
We consider the new divisor 243 and the new remainder 140,and apply the division lemma to get
243 = 140 x 1 + 103
We consider the new divisor 140 and the new remainder 103,and apply the division lemma to get
140 = 103 x 1 + 37
We consider the new divisor 103 and the new remainder 37,and apply the division lemma to get
103 = 37 x 2 + 29
We consider the new divisor 37 and the new remainder 29,and apply the division lemma to get
37 = 29 x 1 + 8
We consider the new divisor 29 and the new remainder 8,and apply the division lemma to get
29 = 8 x 3 + 5
We consider the new divisor 8 and the new remainder 5,and apply the division lemma to get
8 = 5 x 1 + 3
We consider the new divisor 5 and the new remainder 3,and apply the division lemma to get
5 = 3 x 1 + 2
We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get
3 = 2 x 1 + 1
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 1009 and 1392 is 1
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(8,5) = HCF(29,8) = HCF(37,29) = HCF(103,37) = HCF(140,103) = HCF(243,140) = HCF(383,243) = HCF(1009,383) = HCF(1392,1009) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 1009, 1392 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 1009, 1392?
Answer: HCF of 1009, 1392 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 1009, 1392 using Euclid's Algorithm?
Answer: For arbitrary numbers 1009, 1392 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
