Problem 239. Project Euler: Problem 5, Smallest multiple
Solution Stats
Problem Comments
-
3 Comments
FYI: we cannot execute "matlabpool open" on the labs. ;)
Could someone please remove Yunpeng Teng's spoiler comment?
The spoiler comment has been removed. Thank you for pointing that out, Are Mjaavatten.
Solution Comments
-
1 Comment
Great problem!
-
3 Comments
What it does: it finds the maximum number of occurrences for each prime number smaller than x in the factorisations of the numbers 1:x (e.g., for x = 10, the maximum number of occurrences for 2 is 3, since 2*2*2 = 8). If the product of all prime factors taken to the power of their maximum # of occurrences is then taken, the smallest number that is divisible by 1:10 is obtained. So for x = 10: 2 * 2 * 2 * 3 * 3 * 5 * 7 = 2520.
nice
cool
-
1 Comment
This code works but the server is too slow...
Problem Recent Solvers985
Suggested Problems
-
Return a list sorted by number of occurrences
2119 Solvers
-
Find the sum of the elements in the "second" diagonal
1096 Solvers
-
333 Solvers
-
Duplicate each element of a vector.
577 Solvers
-
Natural numbers in string form
970 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!