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