You are viewing a single comment's thread. Return to all comments →
It's a simple observation and quite a nice one. It's clear that N needs to be divisible by primes < N
Now k can be determined by the fact that N lies between p^k and p^(k+1) and any number between p^k and N doesn't need to be divisible by p^(k+1)
so you just need k, where p^k < N.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #5: Smallest multiple
You are viewing a single comment's thread. Return to all comments →
It's a simple observation and quite a nice one.
It's clear that N needs to be divisible by primes < N
Now k can be determined by the fact that N lies between p^k and p^(k+1) and any number between p^k and N doesn't need to be divisible by p^(k+1)
so you just need k, where p^k < N.