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