Problem 239. Project Euler: Problem 5, Smallest multiple

Created by Doug Hull

Solve Later

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

Solve

Solution Stats

Last solution submitted on Sep 16, 2019

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Aurelien Queffurust on 20 Apr 2012

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

Solution Comments

Solution 1688897

1 Comment

1 Comment

Roche de Guzman on 8 Dec 2018

Great problem!

Solution 41338

2 Comments

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

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

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers227

Suggested Problems

More from this Author52

Tags

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers227

Suggested Problems

More from this Author52

Tags

Players