Question

Use Euclid's division algorithm to find the HCF of 16 and 28


I'll mark you as brainlist​

Answer 1

Answer:

Follow the step by step explanation & check the answer for HCF(16,28).

Here 28 is greater than 16

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

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

28 = 16 x 1 + 12

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

16 = 12 x 1 + 4

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

12 = 4 x 3 + 0

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

Step-by-step explanation:

Hope this will help you :)☺