answersLogoWhite

0

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.

User Avatar

Wiki User

12y ago

What else can I help you with?