HCF of 24, 281, 951 using Euclid's algorithm

Below detailed show work will make you learn how to find HCF of 24,281,951 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(24,281,951).

Here 281 is greater than 24

Now, consider the largest number as 'a' from the given number ie., 281 and 24 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

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

281 = 24 x 11 + 17

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

24 = 17 x 1 + 7

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

17 = 7 x 2 + 3

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

7 = 3 x 2 + 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 24 and 281 is 1

Notice that 1 = HCF(3,1) = HCF(7,3) = HCF(17,7) = HCF(24,17) = HCF(281,24) .

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

Here 951 is greater than 1

Now, consider the largest number as 'a' from the given number ie., 951 and 1 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

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

951 = 1 x 951 + 0

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

Notice that 1 = HCF(951,1) .

Therefore, HCF of 24,281,951 using Euclid's division lemma is 1.