Cody

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

Solution 1735913

Submitted on 25 Feb 2019 by A C
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 = uint64 600851475143 y = uint64 6857

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

x = uint64 3916767508299776 y = uint64 457

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

x = uint64 32167675 y = uint64 1286707

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

x = uint64 321676750829977632 y = uint64 206830397

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

x = uint64 321676755 y = uint64 5639

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

x = uint64 361125 y = uint64 107

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

x = uint64 13916767508299776 y = uint64 98779