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

HCF of 964, 763, 789 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 964, 763, 789 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 964, 763, 789 is 1.

HCF(964, 763, 789) = 1

HCF of 964, 763, 789 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 964, 763, 789 is 1.

Highest Common Factor of 964,763,789 using Euclid's algorithm

Highest Common Factor of 964,763,789 is 1

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

964 = 763 x 1 + 201

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

763 = 201 x 3 + 160

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

201 = 160 x 1 + 41

We consider the new divisor 160 and the new remainder 41,and apply the division lemma to get

160 = 41 x 3 + 37

We consider the new divisor 41 and the new remainder 37,and apply the division lemma to get

41 = 37 x 1 + 4

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

37 = 4 x 9 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(37,4) = HCF(41,37) = HCF(160,41) = HCF(201,160) = HCF(763,201) = HCF(964,763) .

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

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

789 = 1 x 789 + 0

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

Notice that 1 = HCF(789,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 964, 763, 789 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 964, 763, 789?

Answer: HCF of 964, 763, 789 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 964, 763, 789 using Euclid's Algorithm?

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