Highest Common Factor of 3784, 2990 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 3784, 2990 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 3784, 2990 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 3784, 2990 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 3784, 2990 is 2.
HCF(3784, 2990) = 2
HCF of 3784, 2990 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 3784, 2990 is 2.
Highest Common Factor of 3784,2990 is 2
Step 1: Since 3784 > 2990, we apply the division lemma to 3784 and 2990, to get
3784 = 2990 x 1 + 794
Step 2: Since the reminder 2990 ≠ 0, we apply division lemma to 794 and 2990, to get
2990 = 794 x 3 + 608
Step 3: We consider the new divisor 794 and the new remainder 608, and apply the division lemma to get
794 = 608 x 1 + 186
We consider the new divisor 608 and the new remainder 186,and apply the division lemma to get
608 = 186 x 3 + 50
We consider the new divisor 186 and the new remainder 50,and apply the division lemma to get
186 = 50 x 3 + 36
We consider the new divisor 50 and the new remainder 36,and apply the division lemma to get
50 = 36 x 1 + 14
We consider the new divisor 36 and the new remainder 14,and apply the division lemma to get
36 = 14 x 2 + 8
We consider the new divisor 14 and the new remainder 8,and apply the division lemma to get
14 = 8 x 1 + 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 3784 and 2990 is 2
Notice that 2 = HCF(6,2) = HCF(8,6) = HCF(14,8) = HCF(36,14) = HCF(50,36) = HCF(186,50) = HCF(608,186) = HCF(794,608) = HCF(2990,794) = HCF(3784,2990) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 3784, 2990 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 3784, 2990?
Answer: HCF of 3784, 2990 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 3784, 2990 using Euclid's Algorithm?
Answer: For arbitrary numbers 3784, 2990 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.