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

Solution 1943547

Submitted on 20 Sep 2019 by NMTri

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	x = 600851475143; y_correct = 6857; assert(isequal(euler003(x),y_correct))
2	Pass	x = 3916767508299776; y_correct = 457; assert(isequal(euler003(x),y_correct))
3	Pass	x = 32167675; y_correct = 1286707; assert(isequal(euler003(x),y_correct))
4	Pass	x = uint64(321676750829977632); y_correct = 206830397; assert(isequal(euler003(x),y_correct))
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	Pass	x = 13916767508299776; y_correct = 98779; assert(isequal(euler003(x),y_correct))