Problem 239. Project Euler: Problem 5, Smallest multiple

Created by Doug Hull

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

Problem Group

Community

Solve This Now!

63 solvers submitted 140 solutions (2.22 solutions/solver).

Solution Map Solution List Solvers

Problem Comments

3 players like this problem

1 Comment

Aurelien Queffurust on 20 Apr 2012

FYI: we cannot execute "matlabpool open" on the labs. ;)

Solution Comments

Solution 41338

2 Comments

blaat on 14 Feb 2012

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.

Alfonso Nieto-Castanon on 14 Feb 2012

nice

Solution 27118

1 Comment

Franck Dernoncourt on 3 Feb 2012

This code works but the server is too slow...

Problem 239. Project Euler: Problem 5, Smallest multiple

Tags

Problem Group

63 solvers submitted 140 solutions (2.22 solutions/solver).

Problem Comments

Solution Comments