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