Cody

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

Solution 2025067

Submitted on 17 Nov 2019 by Le Duc Vu
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))

y = 1×4 int64 row vector 71 839 1471 6857 y = int64 6857

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

y = 1×34 int64 row vector Columns 1 through 30 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 Columns 31 through 34 2 13 307 457 y = int64 457

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

y = 1×3 int64 row vector 5 5 1286707 y = int64 1286707

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

y = 1×12 int64 row vector 2 2 2 2 2 3 3 3 17 19 5573 206830397 y = int64 206830397

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

y = 1×4 int64 row vector 3 5 3803 5639 y = int64 5639

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

y = 1×7 int64 row vector 3 3 3 5 5 5 107 y = int64 107

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

y = 1×20 int64 row vector 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 383 1871 98779 y = int64 98779

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!