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