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

HCF of 903, 5301, 3866 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 903, 5301, 3866 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 903, 5301, 3866 is 1.

HCF(903, 5301, 3866) = 1

HCF of 903, 5301, 3866 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 903, 5301, 3866 is 1.

Highest Common Factor of 903,5301,3866 using Euclid's algorithm

Highest Common Factor of 903,5301,3866 is 1

Step 1: Since 5301 > 903, we apply the division lemma to 5301 and 903, to get

5301 = 903 x 5 + 786

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

903 = 786 x 1 + 117

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

786 = 117 x 6 + 84

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

117 = 84 x 1 + 33

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

84 = 33 x 2 + 18

We consider the new divisor 33 and the new remainder 18,and apply the division lemma to get

33 = 18 x 1 + 15

We consider the new divisor 18 and the new remainder 15,and apply the division lemma to get

18 = 15 x 1 + 3

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

15 = 3 x 5 + 0

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

Notice that 3 = HCF(15,3) = HCF(18,15) = HCF(33,18) = HCF(84,33) = HCF(117,84) = HCF(786,117) = HCF(903,786) = HCF(5301,903) .

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

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

3866 = 3 x 1288 + 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 3866 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(3866,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 903, 5301, 3866 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 903, 5301, 3866?

Answer: HCF of 903, 5301, 3866 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 903, 5301, 3866 using Euclid's Algorithm?

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