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

re: Huh? That's not the algorithm. You misunderstood. The explanation I gave is one of many ways someone can DISCOVER that what you need to do is to f...

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.

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

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 😉

code of conduct - report abuse