DEV Community

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

 
dwayne profile image
Dwayne Crooks

So I need to multiple all the prime numbers in that range

Not exactly. You need to multiply by the highest powers of the primes in the range.

Thread Thread
 
karataev profile image
Eugene Karataev

You do agree that the problem is implicitly asking you to find the LCM of 1,2,3,...,20?

Yes.
And as you mentioned there are at least two ways to solve the problem. Both are valid.

And I don't disagree with you. Start with brute force and improve. You'd then have something to test your optimizations, clever code etc against.

We're on the same page 😉