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