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

HCF of 783, 472, 947 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 783, 472, 947 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 783, 472, 947 is 1.

HCF(783, 472, 947) = 1

HCF of 783, 472, 947 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 783, 472, 947 is 1.

Highest Common Factor of 783,472,947 using Euclid's algorithm

Highest Common Factor of 783,472,947 is 1

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

783 = 472 x 1 + 311

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

472 = 311 x 1 + 161

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

311 = 161 x 1 + 150

We consider the new divisor 161 and the new remainder 150,and apply the division lemma to get

161 = 150 x 1 + 11

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

150 = 11 x 13 + 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 783 and 472 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(11,7) = HCF(150,11) = HCF(161,150) = HCF(311,161) = HCF(472,311) = HCF(783,472) .

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

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

947 = 1 x 947 + 0

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

Notice that 1 = HCF(947,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 783, 472, 947 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 783, 472, 947?

Answer: HCF of 783, 472, 947 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 783, 472, 947 using Euclid's Algorithm?

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