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

HCF of 3387, 8523, 78740 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 3387, 8523, 78740 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 3387, 8523, 78740 is 1.

HCF(3387, 8523, 78740) = 1

HCF of 3387, 8523, 78740 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 3387, 8523, 78740 is 1.

Highest Common Factor of 3387,8523,78740 using Euclid's algorithm

Highest Common Factor of 3387,8523,78740 is 1

Step 1: Since 8523 > 3387, we apply the division lemma to 8523 and 3387, to get

8523 = 3387 x 2 + 1749

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

3387 = 1749 x 1 + 1638

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

1749 = 1638 x 1 + 111

We consider the new divisor 1638 and the new remainder 111,and apply the division lemma to get

1638 = 111 x 14 + 84

We consider the new divisor 111 and the new remainder 84,and apply the division lemma to get

111 = 84 x 1 + 27

We consider the new divisor 84 and the new remainder 27,and apply the division lemma to get

84 = 27 x 3 + 3

We consider the new divisor 27 and the new remainder 3,and apply the division lemma to get

27 = 3 x 9 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 3387 and 8523 is 3

Notice that 3 = HCF(27,3) = HCF(84,27) = HCF(111,84) = HCF(1638,111) = HCF(1749,1638) = HCF(3387,1749) = HCF(8523,3387) .

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

Step 1: Since 78740 > 3, we apply the division lemma to 78740 and 3, to get

78740 = 3 x 26246 + 2

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

3 = 2 x 1 + 1

Step 3: We consider the new divisor 2 and the new remainder 1, and apply the division lemma 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 3 and 78740 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(78740,3) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 3387, 8523, 78740 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 3387, 8523, 78740?

Answer: HCF of 3387, 8523, 78740 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3387, 8523, 78740 using Euclid's Algorithm?

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