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