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

HCF of 9036, 1913, 45827 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 9036, 1913, 45827 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 9036, 1913, 45827 is 1.

HCF(9036, 1913, 45827) = 1

HCF of 9036, 1913, 45827 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 9036, 1913, 45827 is 1.

Highest Common Factor of 9036,1913,45827 using Euclid's algorithm

Highest Common Factor of 9036,1913,45827 is 1

Step 1: Since 9036 > 1913, we apply the division lemma to 9036 and 1913, to get

9036 = 1913 x 4 + 1384

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

1913 = 1384 x 1 + 529

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

1384 = 529 x 2 + 326

We consider the new divisor 529 and the new remainder 326,and apply the division lemma to get

529 = 326 x 1 + 203

We consider the new divisor 326 and the new remainder 203,and apply the division lemma to get

326 = 203 x 1 + 123

We consider the new divisor 203 and the new remainder 123,and apply the division lemma to get

203 = 123 x 1 + 80

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

123 = 80 x 1 + 43

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

80 = 43 x 1 + 37

We consider the new divisor 43 and the new remainder 37,and apply the division lemma to get

43 = 37 x 1 + 6

We consider the new divisor 37 and the new remainder 6,and apply the division lemma to get

37 = 6 x 6 + 1

We consider the new divisor 6 and the new remainder 1,and apply the division lemma to get

6 = 1 x 6 + 0

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

Notice that 1 = HCF(6,1) = HCF(37,6) = HCF(43,37) = HCF(80,43) = HCF(123,80) = HCF(203,123) = HCF(326,203) = HCF(529,326) = HCF(1384,529) = HCF(1913,1384) = HCF(9036,1913) .

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

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

45827 = 1 x 45827 + 0

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

Notice that 1 = HCF(45827,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 9036, 1913, 45827 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 9036, 1913, 45827?

Answer: HCF of 9036, 1913, 45827 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9036, 1913, 45827 using Euclid's Algorithm?

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