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

HCF of 9021, 7159 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 9021, 7159 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 9021, 7159 is 1.

HCF(9021, 7159) = 1

HCF of 9021, 7159 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 9021, 7159 is 1.

Highest Common Factor of 9021,7159 using Euclid's algorithm

Highest Common Factor of 9021,7159 is 1

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

9021 = 7159 x 1 + 1862

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

7159 = 1862 x 3 + 1573

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

1862 = 1573 x 1 + 289

We consider the new divisor 1573 and the new remainder 289,and apply the division lemma to get

1573 = 289 x 5 + 128

We consider the new divisor 289 and the new remainder 128,and apply the division lemma to get

289 = 128 x 2 + 33

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

128 = 33 x 3 + 29

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

33 = 29 x 1 + 4

We consider the new divisor 29 and the new remainder 4,and apply the division lemma to get

29 = 4 x 7 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(29,4) = HCF(33,29) = HCF(128,33) = HCF(289,128) = HCF(1573,289) = HCF(1862,1573) = HCF(7159,1862) = HCF(9021,7159) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9021, 7159 using Euclid's Algorithm?

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