Any faster algorithm to find the least common multiple?

204 Views Asked by At

To find the least common multiple of $a,b$, call it $\operatorname{lcm}(a,b)$, divide there product by there greatest common divisor. However, finding the gcd requires at most $\log n$ time. I am wondering if there is a faster algorithm than so.