Question

Find the HCF Of 30 and 17 by using Euclid division algorithm

Answer 1

Answer:

mark me in brain list answer thanks so much

Thanks also

Answer 2

Answer:

Step-by-step explanation:

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

Here 30 is greater than 17

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

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

30 = 17 x 1 + 13

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

17 = 13 x 1 + 4

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

13 = 4 x 3 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(13,4) = HCF(17,13) = HCF(30,17) .