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

HCF of 1248, 473 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 1248, 473 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 1248, 473 is 1.

HCF(1248, 473) = 1

HCF of 1248, 473 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 1248, 473 is 1.

Highest Common Factor of 1248,473 using Euclid's algorithm

Highest Common Factor of 1248,473 is 1

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

1248 = 473 x 2 + 302

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

473 = 302 x 1 + 171

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

302 = 171 x 1 + 131

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

171 = 131 x 1 + 40

We consider the new divisor 131 and the new remainder 40,and apply the division lemma to get

131 = 40 x 3 + 11

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

40 = 11 x 3 + 7

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

11 = 7 x 1 + 4

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

7 = 4 x 1 + 3

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

4 = 3 x 1 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(11,7) = HCF(40,11) = HCF(131,40) = HCF(171,131) = HCF(302,171) = HCF(473,302) = HCF(1248,473) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 1248, 473 using Euclid's Algorithm?

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