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

HCF of 4897, 7963, 11189 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 4897, 7963, 11189 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 4897, 7963, 11189 is 1.

HCF(4897, 7963, 11189) = 1

HCF of 4897, 7963, 11189 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 4897, 7963, 11189 is 1.

Highest Common Factor of 4897,7963,11189 using Euclid's algorithm

Highest Common Factor of 4897,7963,11189 is 1

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

7963 = 4897 x 1 + 3066

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

4897 = 3066 x 1 + 1831

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

3066 = 1831 x 1 + 1235

We consider the new divisor 1831 and the new remainder 1235,and apply the division lemma to get

1831 = 1235 x 1 + 596

We consider the new divisor 1235 and the new remainder 596,and apply the division lemma to get

1235 = 596 x 2 + 43

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

596 = 43 x 13 + 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 4897 and 7963 is 1

Notice that 1 = HCF(6,1) = HCF(37,6) = HCF(43,37) = HCF(596,43) = HCF(1235,596) = HCF(1831,1235) = HCF(3066,1831) = HCF(4897,3066) = HCF(7963,4897) .

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

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

11189 = 1 x 11189 + 0

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

Notice that 1 = HCF(11189,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 4897, 7963, 11189 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 4897, 7963, 11189?

Answer: HCF of 4897, 7963, 11189 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 4897, 7963, 11189 using Euclid's Algorithm?

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