Question

a/b -5 find lcm...............​

Answer 1

Answer:

b is the lcm...........

Answer 2

Answer:

$\huge{\fbox{\fbox{\bigstar{\mathfrak{\red{Answer}}}}}}$

The least common multiple can be found using the identity lcm(A,B)gcd(A,B)=|AB|. The gcd can be found using the Euclidean Algorithm, which does not require you to find the prime factorization. So you can find the least common multiple without knowing the prime factorization