HCF of 30, 264, 495 using Euclid's algorithm

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

Here 264 is greater than 30

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

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

264 = 30 x 8 + 24

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

30 = 24 x 1 + 6

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

24 = 6 x 4 + 0

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

Notice that 6 = HCF(24,6) = HCF(30,24) = HCF(264,30) .

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

Here 495 is greater than 6

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

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

495 = 6 x 82 + 3

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

6 = 3 x 2 + 0

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

Notice that 3 = HCF(6,3) = HCF(495,6) .

Therefore, HCF of 30,264,495 using Euclid's division lemma is 3.