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