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