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