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

HCF of 751, 959 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 751, 959 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 751, 959 is 1.

HCF(751, 959) = 1

HCF of 751, 959 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 751, 959 is 1.

Highest Common Factor of 751,959 using Euclid's algorithm

Highest Common Factor of 751,959 is 1

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

959 = 751 x 1 + 208

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

751 = 208 x 3 + 127

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

208 = 127 x 1 + 81

We consider the new divisor 127 and the new remainder 81,and apply the division lemma to get

127 = 81 x 1 + 46

We consider the new divisor 81 and the new remainder 46,and apply the division lemma to get

81 = 46 x 1 + 35

We consider the new divisor 46 and the new remainder 35,and apply the division lemma to get

46 = 35 x 1 + 11

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

35 = 11 x 3 + 2

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

11 = 2 x 5 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(35,11) = HCF(46,35) = HCF(81,46) = HCF(127,81) = HCF(208,127) = HCF(751,208) = HCF(959,751) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 751, 959 using Euclid's Algorithm?

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