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