Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 468433

Submitted on 9 Jul 2014 by goc3
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))

c = 16 y = 16 c = 9 y = 144 c = 5 y = 720 c = 7 y = 5040 c = 11 y = 55440 c = 13 y = 720720 c = 17 y = 12252240 c = 19 y = 232792560

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

c = 8 y = 8 c = 9 y = 72 c = 5 y = 360 c = 7 y = 2520

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

c = 8 y = 8 c = 9 y = 72 c = 5 y = 360 c = 7 y = 2520 c = 11 y = 27720

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

c = 8 y = 8 c = 9 y = 72 c = 5 y = 360 c = 7 y = 2520 c = 11 y = 27720 c = 13 y = 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!