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