Question

find lcm(30,40)using euclids algorithm​

Answer 1

Let a=40 and b=30

Euclid's algorithm used to determine HCF of a and b

a=bq+ra=bq+r

Where$0\leq r < b0≤r<b$

a=Dividend

b=Divisor

q=Quotient

r=Remainder

By using Euclid's algorithm

$40=30\times 1+1040=30×1+10$

$30=10\times 3+030=10×3+0$

When remainder zero then the value of divisor is called HCF of a and b.

Therefore, when remainder is zero then divisor=10=HCF