Cody

Problem 239. Project Euler: Problem 5, Smallest multiple

Solution 2032702

Submitted on 23 Nov 2019 by Sinh Luong
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))

y = 2.4329e+18 y = 1.2165e+17 y = 6.7581e+15 y = 4.2238e+14 y = 2.8159e+13 y = 2.0113e+12 y = 1.6761e+11 y = 1.6761e+10 y = 1.8623e+09 y = 232792560

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

y = 3628800 y = 362880 y = 40320 y = 5040 y = 2520

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

y = 479001600 y = 39916800 y = 3991680 y = 443520 y = 55440 y = 27720

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

y = 8.7178e+10 y = 6.2270e+09 y = 518918400 y = 51891840 y = 5765760 y = 720720 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!