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