Highest Common Factor of 1866, 4064 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 1866, 4064 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 1866, 4064 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 1866, 4064 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 1866, 4064 is 2.

HCF(1866, 4064) = 2

HCF of 1866, 4064 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 1866, 4064 is 2.

Highest Common Factor of 1866,4064 using Euclid's algorithm

Highest Common Factor of 1866,4064 is 2

Step 1: Since 4064 > 1866, we apply the division lemma to 4064 and 1866, to get

4064 = 1866 x 2 + 332

Step 2: Since the reminder 1866 ≠ 0, we apply division lemma to 332 and 1866, to get

1866 = 332 x 5 + 206

Step 3: We consider the new divisor 332 and the new remainder 206, and apply the division lemma to get

332 = 206 x 1 + 126

We consider the new divisor 206 and the new remainder 126,and apply the division lemma to get

206 = 126 x 1 + 80

We consider the new divisor 126 and the new remainder 80,and apply the division lemma to get

126 = 80 x 1 + 46

We consider the new divisor 80 and the new remainder 46,and apply the division lemma to get

80 = 46 x 1 + 34

We consider the new divisor 46 and the new remainder 34,and apply the division lemma to get

46 = 34 x 1 + 12

We consider the new divisor 34 and the new remainder 12,and apply the division lemma to get

34 = 12 x 2 + 10

We consider the new divisor 12 and the new remainder 10,and apply the division lemma to get

12 = 10 x 1 + 2

We consider the new divisor 10 and the new remainder 2,and apply the division lemma to get

10 = 2 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 1866 and 4064 is 2

Notice that 2 = HCF(10,2) = HCF(12,10) = HCF(34,12) = HCF(46,34) = HCF(80,46) = HCF(126,80) = HCF(206,126) = HCF(332,206) = HCF(1866,332) = HCF(4064,1866) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 1866, 4064 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 1866, 4064?

Answer: HCF of 1866, 4064 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1866, 4064 using Euclid's Algorithm?

Answer: For arbitrary numbers 1866, 4064 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.