Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 255261

Submitted on 5 Jun 2013 by Przemyslaw
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

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

y = 232792560

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

y = 5040

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

y = 27720

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

y = 360360

Suggested Problems

More from this Author52