Question

Find LCM (30,50) using Euclid's division algorithm ?​

Answer 1

Answer:

50>30

50>30×1+20

30>20×1+10

20>10×2+0

lcm=10

Answer 2

HCF(50,30)=10

Step-by-step explanation:

Let a=50 and b=30

Euclid's algorithm used for HCF of a and b

$a=bq+r$

Where $0\leq r<b$

a=Dividend

b=Divisor

r=Remainder

q=Quotient

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

Using the algorithm

$50=30\times 1+20$

$30=20\times 1+10$

$20=10\times 2+0$

HCF(50,30)=10

#Learns more:

https://brainly.in/question/14047817:Answered by mathslover