Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 1036564

Submitted on 29 Oct 2016 by Andriy Kavetsky
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = 20; y_correct = 232792560; assert(isequal(euler005(x),y_correct))

l = 1 l = 2 l = 6 l = 12 l = 60 l = 60 l = 420 l = 840 l = 2520 l = 2520 l = 27720 l = 27720 l = 360360 l = 360360 l = 360360 l = 720720 l = 12252240 l = 12252240 l = 232792560 l = 232792560 y = 232792560

2   Pass
x = 10; y_correct = 2520; assert(isequal(euler005(x),y_correct))

l = 1 l = 2 l = 6 l = 12 l = 60 l = 60 l = 420 l = 840 l = 2520 l = 2520 y = 2520

3   Pass
x = 12; y_correct = 27720; assert(isequal(euler005(x),y_correct))

l = 1 l = 2 l = 6 l = 12 l = 60 l = 60 l = 420 l = 840 l = 2520 l = 2520 l = 27720 l = 27720 y = 27720

4   Pass
x = 14; y_correct = 360360; assert(isequal(euler005(x),y_correct))

l = 1 l = 2 l = 6 l = 12 l = 60 l = 60 l = 420 l = 840 l = 2520 l = 2520 l = 27720 l = 27720 l = 360360 l = 360360 y = 360360

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!