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

HCF of 1148, 3123 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 1148, 3123 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 1148, 3123 is 1.

HCF(1148, 3123) = 1

HCF of 1148, 3123 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 1148, 3123 is 1.

Highest Common Factor of 1148,3123 using Euclid's algorithm

Highest Common Factor of 1148,3123 is 1

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

3123 = 1148 x 2 + 827

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

1148 = 827 x 1 + 321

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

827 = 321 x 2 + 185

We consider the new divisor 321 and the new remainder 185,and apply the division lemma to get

321 = 185 x 1 + 136

We consider the new divisor 185 and the new remainder 136,and apply the division lemma to get

185 = 136 x 1 + 49

We consider the new divisor 136 and the new remainder 49,and apply the division lemma to get

136 = 49 x 2 + 38

We consider the new divisor 49 and the new remainder 38,and apply the division lemma to get

49 = 38 x 1 + 11

We consider the new divisor 38 and the new remainder 11,and apply the division lemma to get

38 = 11 x 3 + 5

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

11 = 5 x 2 + 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 1148 and 3123 is 1

Notice that 1 = HCF(5,1) = HCF(11,5) = HCF(38,11) = HCF(49,38) = HCF(136,49) = HCF(185,136) = HCF(321,185) = HCF(827,321) = HCF(1148,827) = HCF(3123,1148) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 1148, 3123 using Euclid's Algorithm?

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