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