Cody

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

Solution 2026703

Submitted on 18 Nov 2019 at 18:06 by Luu Van Duc
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 = 600851475143; y_correct = 6857; assert(isequal(euler003(x),y_correct))

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

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

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

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

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

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

y = 98779

Suggested Problems

More from this Author52