Highest Common Factor of 1026, 3956, 39385 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 1026, 3956, 39385 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 1026, 3956, 39385 is 1 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 1026, 3956, 39385 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 1026, 3956, 39385 is 1.

HCF(1026, 3956, 39385) = 1

HCF of 1026, 3956, 39385 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 1026, 3956, 39385 is 1.

Highest Common Factor of 1026,3956,39385 using Euclid's algorithm

Highest Common Factor of 1026,3956,39385 is 1

Step 1: Since 3956 > 1026, we apply the division lemma to 3956 and 1026, to get

3956 = 1026 x 3 + 878

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

1026 = 878 x 1 + 148

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

878 = 148 x 5 + 138

We consider the new divisor 148 and the new remainder 138,and apply the division lemma to get

148 = 138 x 1 + 10

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

138 = 10 x 13 + 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 1026 and 3956 is 2

Notice that 2 = HCF(8,2) = HCF(10,8) = HCF(138,10) = HCF(148,138) = HCF(878,148) = HCF(1026,878) = HCF(3956,1026) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 39385 > 2, we apply the division lemma to 39385 and 2, to get

39385 = 2 x 19692 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(39385,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 1026, 3956, 39385 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 1026, 3956, 39385?

Answer: HCF of 1026, 3956, 39385 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1026, 3956, 39385 using Euclid's Algorithm?

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