Cody

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

Solution 25119

Submitted on 2 Feb 2012
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   Fail
%% x = 600851475143; y_correct = 6857; assert(isequal(euler003(x),y_correct))

Error: The maximum value of n allowed is 2^32.

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

Error: The maximum value of n allowed is 2^32.

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

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

Error: The maximum value of n allowed is 2^32.

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

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

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

Error: The maximum value of n allowed is 2^32.

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!