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

HCF of 9615, 5385, 60062 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 9615, 5385, 60062 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 9615, 5385, 60062 is 1.

HCF(9615, 5385, 60062) = 1

HCF of 9615, 5385, 60062 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 9615, 5385, 60062 is 1.

Highest Common Factor of 9615,5385,60062 using Euclid's algorithm

Highest Common Factor of 9615,5385,60062 is 1

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

9615 = 5385 x 1 + 4230

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

5385 = 4230 x 1 + 1155

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

4230 = 1155 x 3 + 765

We consider the new divisor 1155 and the new remainder 765,and apply the division lemma to get

1155 = 765 x 1 + 390

We consider the new divisor 765 and the new remainder 390,and apply the division lemma to get

765 = 390 x 1 + 375

We consider the new divisor 390 and the new remainder 375,and apply the division lemma to get

390 = 375 x 1 + 15

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

375 = 15 x 25 + 0

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

Notice that 15 = HCF(375,15) = HCF(390,375) = HCF(765,390) = HCF(1155,765) = HCF(4230,1155) = HCF(5385,4230) = HCF(9615,5385) .

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

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

60062 = 15 x 4004 + 2

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

15 = 2 x 7 + 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 15 and 60062 is 1

Notice that 1 = HCF(2,1) = HCF(15,2) = HCF(60062,15) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 9615, 5385, 60062 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 9615, 5385, 60062?

Answer: HCF of 9615, 5385, 60062 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9615, 5385, 60062 using Euclid's Algorithm?

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