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