DEV Community


Discussion on: Project Euler #5 - Finding the Smallest Multiple

maxart2501 profile image
Massimo Artizzu

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.)

1258632 profile image

Please do propose your version in javascript. Certainly it will not be excessive