Cody

Problem 234. Project Euler: Problem 3, Largest prime factor

Solution 2898407

Submitted on 1 Sep 2020 by Jens Kjærgaard Boldsen
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 = 600851475143; y_correct = 6857; assert(isequal(euler003(x),y_correct))

x = 6.0085e+11 mx = 1

2   Pass
x = 3916767508299776; y_correct = 457; assert(isequal(euler003(x),y_correct))

x = 140299 mx = 13

3   Pass
x = 32167675; y_correct = 1286707; assert(isequal(euler003(x),y_correct))

x = 1286707 mx = 5

4   Pass
x = uint64(321676750829977632); y_correct = 206830397; assert(isequal(euler003(x),y_correct))

x = uint64 21900650247139 mx = 17

5   Pass
x = 321676755; y_correct = 5639; assert(isequal(euler003(x),y_correct))

x = 21445117 mx = 5

6   Pass
x = 361125; y_correct = 107; assert(isequal(euler003(x),y_correct))

x = 107 mx = 5

7   Pass
x = 13916767508299776; y_correct = 98779; assert(isequal(euler003(x),y_correct))

x = 7.0784e+10 mx = 3

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!