Question

| Find the HCF of- and by using Euclidis
division lemma​

Answer 1

please give some numbers

Answer 2

Step-by-step explanation:

Euclid's division algorithm: This is based on Euclid's division lemma. According to this, the HCF of any two positive integers a and b, with a>b, is obtained as follows: Step 1: Apply the division lemma to find q and r where a=bq+r ,0⩽r<b. Step 2: if r=0, the HCF is b.