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