Cody

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

Solution 2042277

Submitted on 2 Dec 2019 by Asif Newaz
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))

a = '600851475143' b = 12 y = 6857

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

a = '3916767508299776' b = 16 y = 457

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

a = '32167675' b = 8 y = 1286707

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

a = '321676750829977632' b = 18 y = uint64 206830397

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

a = '321676755' b = 9 y = 5639

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

a = '361125' b = 6 y = 107

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

a = '1.391676750829978e+16' b = 21 x = uint64 13916767508299776 y = uint64 98779