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