Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 1991206

Submitted on 25 Oct 2019 by Eugene Kronberg

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	x = 20; y_correct = 232792560; assert(isequal(euler005(x),y_correct))
2	Pass	x = 10; y_correct = 2520; assert(isequal(euler005(x),y_correct))
3	Pass	x = 12; y_correct = 27720; assert(isequal(euler005(x),y_correct))
4	Pass	x = 14; y_correct = 360360; assert(isequal(euler005(x),y_correct))