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
FYI: we cannot execute "matlabpool open" on the labs. ;)
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
This code works but the server is too slow...
6649 Solvers
Sort a list of complex numbers based on far they are from the origin.
3645 Solvers
505 Solvers
Back to basics 24 - Symbolic variables
113 Solvers
Create a square matrix of multiples
315 Solvers