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

HCF of 7815, 9001 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 7815, 9001 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 7815, 9001 is 1.

HCF(7815, 9001) = 1

HCF of 7815, 9001 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 7815, 9001 is 1.

Highest Common Factor of 7815,9001 using Euclid's algorithm

Highest Common Factor of 7815,9001 is 1

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

9001 = 7815 x 1 + 1186

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

7815 = 1186 x 6 + 699

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

1186 = 699 x 1 + 487

We consider the new divisor 699 and the new remainder 487,and apply the division lemma to get

699 = 487 x 1 + 212

We consider the new divisor 487 and the new remainder 212,and apply the division lemma to get

487 = 212 x 2 + 63

We consider the new divisor 212 and the new remainder 63,and apply the division lemma to get

212 = 63 x 3 + 23

We consider the new divisor 63 and the new remainder 23,and apply the division lemma to get

63 = 23 x 2 + 17

We consider the new divisor 23 and the new remainder 17,and apply the division lemma to get

23 = 17 x 1 + 6

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

17 = 6 x 2 + 5

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

6 = 5 x 1 + 1

We consider the new divisor 5 and the new remainder 1,and apply the division lemma 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 7815 and 9001 is 1

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(17,6) = HCF(23,17) = HCF(63,23) = HCF(212,63) = HCF(487,212) = HCF(699,487) = HCF(1186,699) = HCF(7815,1186) = HCF(9001,7815) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 7815, 9001 using Euclid's Algorithm?

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