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