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