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