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