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

HCF of 9045, 5117 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 9045, 5117 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 9045, 5117 is 1.

HCF(9045, 5117) = 1

HCF of 9045, 5117 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 9045, 5117 is 1.

Highest Common Factor of 9045,5117 using Euclid's algorithm

Highest Common Factor of 9045,5117 is 1

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

9045 = 5117 x 1 + 3928

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

5117 = 3928 x 1 + 1189

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

3928 = 1189 x 3 + 361

We consider the new divisor 1189 and the new remainder 361,and apply the division lemma to get

1189 = 361 x 3 + 106

We consider the new divisor 361 and the new remainder 106,and apply the division lemma to get

361 = 106 x 3 + 43

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

106 = 43 x 2 + 20

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

43 = 20 x 2 + 3

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

20 = 3 x 6 + 2

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

3 = 2 x 1 + 1

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 9045 and 5117 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(20,3) = HCF(43,20) = HCF(106,43) = HCF(361,106) = HCF(1189,361) = HCF(3928,1189) = HCF(5117,3928) = HCF(9045,5117) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 9045, 5117 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 9045, 5117?

Answer: HCF of 9045, 5117 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9045, 5117 using Euclid's Algorithm?

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