We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Really nice solution! Using reduce to iteratively build up the LCM of {1,..,n} should have been obvious, but I wandered down a road of prime factorisations. Thanks for the post. My Python 3 solution on the same lines:
Project Euler #5: Smallest multiple
You are viewing a single comment's thread. Return to all comments →
Really nice solution! Using reduce to iteratively build up the LCM of {1,..,n} should have been obvious, but I wandered down a road of prime factorisations. Thanks for the post. My Python 3 solution on the same lines: