The most significant part here is that you can compute the least common multiple by computing the greatest common denominator and using it to divide the product of the two numbers.

I was about to propose a similar solution (in JavaScript) but yours is sufficient 👍
(Yes, the language itself isn't important for me. Just the mathematical challenge.)

## re: Project Euler #5 - Finding the Smallest Multiple VIEW POST

FULL DISCUSSIONHere's mine!

The most significant part here is that you can compute the least common multiple by computing the greatest common denominator and using it to divide the product of the two numbers.

I was about to propose a similar solution (in JavaScript) but yours is sufficient 👍

(Yes, the language itself isn't important for me. Just the mathematical challenge.)