Question

18. Find LCM (30, 40) using Euclid's division algorithm ​

Answer 1

Answer:

40=30×1+10

30=10×3+0

therefore,LCM(30,40)=10

Answer 2

HCF(30,40)=10

Step-by-step explanation:

40>30

Let a=40 and b=30

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

$a=bq+r$

Where $0\leq r<b$

a=Dividend

b=Divisor

q=Quotient

r=Remainder

By using Euclid's algorithm

$40=30\times 1+10$

$30=10\times 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

HCF(30,40)=10

#Learns more:

https://brainly.in/question/9586288