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