Question

Find the HCF of 15 and 66 using Euclid’s division algorithm.​

Answer 1

Answer:

Determining HCF of Numbers 66,15 by Euclid's Division Lemma

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

Here 66 is greater than 15

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

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

66 = 15 x 4 + 6

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

15 = 6 x 2 + 3

Step 3: We consider the new divisor 6 and the new remainder 3, and apply the division lemma 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 66 and 15 is 3

Notice that 3 = HCF(6,3) = HCF(15,6) = HCF(66,15)

Step-by-step explanation:

BRAINN LEST PLZ