Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 2022669

Submitted on 15 Nov 2019 by Helen Tran
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))

factors = 2 3 5 17 19 y = 323

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

factors = 2 3 5 7 y = 35

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

factors = 2 3 5 7 11 y = 77

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

factors = 2 3 5 7 11 13 y = 143

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!