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