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