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

HCF of 9757, 6772, 79225 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 9757, 6772, 79225 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 9757, 6772, 79225 is 1.

HCF(9757, 6772, 79225) = 1

HCF of 9757, 6772, 79225 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 9757, 6772, 79225 is 1.

Highest Common Factor of 9757,6772,79225 using Euclid's algorithm

Highest Common Factor of 9757,6772,79225 is 1

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

9757 = 6772 x 1 + 2985

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

6772 = 2985 x 2 + 802

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

2985 = 802 x 3 + 579

We consider the new divisor 802 and the new remainder 579,and apply the division lemma to get

802 = 579 x 1 + 223

We consider the new divisor 579 and the new remainder 223,and apply the division lemma to get

579 = 223 x 2 + 133

We consider the new divisor 223 and the new remainder 133,and apply the division lemma to get

223 = 133 x 1 + 90

We consider the new divisor 133 and the new remainder 90,and apply the division lemma to get

133 = 90 x 1 + 43

We consider the new divisor 90 and the new remainder 43,and apply the division lemma to get

90 = 43 x 2 + 4

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

43 = 4 x 10 + 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 9757 and 6772 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(43,4) = HCF(90,43) = HCF(133,90) = HCF(223,133) = HCF(579,223) = HCF(802,579) = HCF(2985,802) = HCF(6772,2985) = HCF(9757,6772) .

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

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

79225 = 1 x 79225 + 0

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

Notice that 1 = HCF(79225,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 9757, 6772, 79225 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 9757, 6772, 79225?

Answer: HCF of 9757, 6772, 79225 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9757, 6772, 79225 using Euclid's Algorithm?

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