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

HCF of 8375, 5335, 18936 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 8375, 5335, 18936 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 8375, 5335, 18936 is 1.

HCF(8375, 5335, 18936) = 1

HCF of 8375, 5335, 18936 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 8375, 5335, 18936 is 1.

Highest Common Factor of 8375,5335,18936 using Euclid's algorithm

Highest Common Factor of 8375,5335,18936 is 1

Step 1: Since 8375 > 5335, we apply the division lemma to 8375 and 5335, to get

8375 = 5335 x 1 + 3040

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

5335 = 3040 x 1 + 2295

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

3040 = 2295 x 1 + 745

We consider the new divisor 2295 and the new remainder 745,and apply the division lemma to get

2295 = 745 x 3 + 60

We consider the new divisor 745 and the new remainder 60,and apply the division lemma to get

745 = 60 x 12 + 25

We consider the new divisor 60 and the new remainder 25,and apply the division lemma to get

60 = 25 x 2 + 10

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

25 = 10 x 2 + 5

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

10 = 5 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 5, the HCF of 8375 and 5335 is 5

Notice that 5 = HCF(10,5) = HCF(25,10) = HCF(60,25) = HCF(745,60) = HCF(2295,745) = HCF(3040,2295) = HCF(5335,3040) = HCF(8375,5335) .

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

Step 1: Since 18936 > 5, we apply the division lemma to 18936 and 5, to get

18936 = 5 x 3787 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(18936,5) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 8375, 5335, 18936 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 8375, 5335, 18936?

Answer: HCF of 8375, 5335, 18936 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 8375, 5335, 18936 using Euclid's Algorithm?

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