Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 3403668

Submitted on 26 Oct 2020 at 20:09 by Predrag Vukovic
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))

For x = 20 minimum divisible by all is 232792560

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

For x = 10 minimum divisible by all is 2520

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

For x = 12 minimum divisible by all is 27720

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

For x = 14 minimum divisible by all is 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!