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.
Great problem!
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
This code works but the server is too slow...
Read a column of numbers and interpolate missing data
1280 Solvers
How to find the position of an element in a vector without using the find function
2486 Solvers
Project Euler: Problem 1, Multiples of 3 and 5
1565 Solvers
4857 Solvers
2538 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!