Question

We can not find LCM of two positive integers by using Euclid's division algorithnm. (True / False)​

Answer 1

Answer:

False...

We can calculate HCF by Euclid's division algorithm

but by the value of HCF and 2 numbers a and b in LCM x HCF=a x b

we can find LCM

Answer 2

Answer:

No it cannot be used to calculate LCM of two numbers.

Step-by-step explanation:

No it cannot be used to calculate LCM of two numbers.

It is used to calculate the HCF of two or more number.

For better understanding you can say the Euclids's Division Lemma is just a form of Long Division method to claculate the HCF.

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. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.

Hope you got your answer!!!!!!