Problem 239. Project Euler: Problem 5, Smallest multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to input number?
Thank you to Project Euler Problem 5
Solution Stats
Problem Comments
-
3 Comments
Aurelien Queffurust
on 20 Apr 2012
FYI: we cannot execute "matlabpool open" on the labs. ;)
Are Mjaavatten
on 22 Jan 2021
Could someone please remove Yunpeng Teng's spoiler comment?
goc3
on 25 Jan 2021
The spoiler comment has been removed. Thank you for pointing that out, Are Mjaavatten.
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers1503
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!