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

HCF of 1191, 2836, 30363 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 1191, 2836, 30363 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 1191, 2836, 30363 is 1.

HCF(1191, 2836, 30363) = 1

HCF of 1191, 2836, 30363 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 1191, 2836, 30363 is 1.

Highest Common Factor of 1191,2836,30363 using Euclid's algorithm

Highest Common Factor of 1191,2836,30363 is 1

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

2836 = 1191 x 2 + 454

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

1191 = 454 x 2 + 283

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

454 = 283 x 1 + 171

We consider the new divisor 283 and the new remainder 171,and apply the division lemma to get

283 = 171 x 1 + 112

We consider the new divisor 171 and the new remainder 112,and apply the division lemma to get

171 = 112 x 1 + 59

We consider the new divisor 112 and the new remainder 59,and apply the division lemma to get

112 = 59 x 1 + 53

We consider the new divisor 59 and the new remainder 53,and apply the division lemma to get

59 = 53 x 1 + 6

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

53 = 6 x 8 + 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 1191 and 2836 is 1

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(53,6) = HCF(59,53) = HCF(112,59) = HCF(171,112) = HCF(283,171) = HCF(454,283) = HCF(1191,454) = HCF(2836,1191) .

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

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

30363 = 1 x 30363 + 0

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

Notice that 1 = HCF(30363,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 1191, 2836, 30363 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 1191, 2836, 30363?

Answer: HCF of 1191, 2836, 30363 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 1191, 2836, 30363 using Euclid's Algorithm?

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