Question

Do THIS
Find the HCF of the following by using Euclid division lemma.
(i) 50 and 70
(ii) 96 and 72
(iii) 300 and 550
(iv) 1860 and 2015
​

Answer 1

Answer:

see I will tell u the formula to solve this but u need to do it by urself so that u can also learn

ohk

I am saying this bcz I also want u to learn this not just copy and paste

I am not getting rude on u sry if u feel like that but u also need to learn the concept right !

Step-by-step explanation:

According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r < b. The basis of the Euclidean division algorithm is Euclid's division lemma.