Best Answer

A x B/HCF(a,b)

User Avatar

Wiki User

โˆ™ 2012-07-03 08:33:21
This answer is:
User Avatar
Study guides


20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

See all cards
1749 Reviews

Add your answer:

Earn +20 pts
Q: How do you find LCM by Euclid's Division Algorithm?
Write your answer...
Still have questions?
magnify glass
Related questions

What is the algorithm of LCM of more than 3 numbers?

If you use methods based on prime factors, it is the same whether you have 2, 3, or more numbers: find all the factors that occur in any of your numbers. If you use a method based on Euclid's Algorithm (that is, lcm(a, b) = a x b / gcf(a, b), where you find the gcf with Euclid's Algorithm), then you can find the lcm for two numbers at a time. For example, to get the lcm of four numbers, find the lcm of the first two, then the lcm of the result and the third number, than the lcm of the result and the fourth number.

How do you find the LCM of 3 numbers through the common division method?

Find the LCM of the first two numbers and then find the LCM of that number and the third one. That answer will be the LCM of all three.

What is the LCM of 16 usind continuous division?

Two or more numbers are needed to find their LCM

What is the LCM of 81230 using continuous division?

Two or more numbers are needed to find their LCM

How you can find LCM by division method?

216 ,4587 and 2378

How do you use continuous division method to find the GCF and LCM of 35 and 14?

The GCF is 7.The LCM is 70.

What is the LCM of 10 and 12 by division method?

The LCM is 60.

How do you find the LCM by continuous division?

all you have to do is find the "least common multiple" witch is also the leats common denomenator

How do you write a C program to find the GCD and LCM. write the flowchart and algorithm of the above program?

This question is not a question. You are supposed to do your homework yourself.

Write a c program to find the LCM of two numbers using recursion algorithm?

void lcm(int m,int n) { int i; for(i=1;i++) { if(i%m==0&&i%n==0) return i; }

What is the division ladder of 10?

The prime factorization of 10 is 2 x 5. You need another number to find a GCF or LCM.

What is the hardest lcm math problem?

None is particularly hard if you use Euclid's algorithm to find the greatest common factor first, then use the fact that for any two numbers "a" and "b": lcm(a, b) x gcf(a, b) = a x b.

People also asked