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