Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 3069016

Submitted on 5 Oct 2020 by Fazlul Haque
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))

b = 20 b = 20 b = 60 b = 60 b = 60 b = 60 b = 420 b = 840 b = 2520 b = 2520 b = 27720 b = 27720 b = 360360 b = 360360 b = 360360 b = 720720 b = 12252240 b = 12252240 b = 232792560 b = 232792560

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

b = 10 b = 10 b = 30 b = 60 b = 60 b = 60 b = 420 b = 840 b = 2520 b = 2520

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

b = 12 b = 12 b = 12 b = 12 b = 60 b = 60 b = 420 b = 840 b = 2520 b = 2520 b = 27720 b = 27720

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

b = 14 b = 14 b = 42 b = 84 b = 420 b = 420 b = 420 b = 840 b = 2520 b = 2520 b = 27720 b = 27720 b = 360360 b = 360360

Suggested Problems

More from this Author52

Community Treasure Hunt

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

Start Hunting!