Problem 241. Project Euler: Problem 7, Nth prime

Solution 292972

Submitted on 31 Jul 2013 by Ramy Mohamed

Size: 20
Leading solution size is 7.

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

2 Comments

2 Comments

Ramy Mohamed on 31 Jul 2013

I do not know how the size are computed. Would someone please tell me?. Thanks in advance.

David Verrelli on 12 Mar 2018

See https://au.mathworks.com/matlabcentral/about/cody/#solve_problems for basic concept. The best way to figure out the details is from experience — just try different alternatives.

Test Suite

Test	Status	Code Input and Output
1	Pass	%% x = 6; y_correct = 13; assert(isequal(euler007(x),y_correct))
2	Pass	%% x = 10001; y_correct = 104743; assert(isequal(euler007(x),y_correct))
3	Pass	%% x = 123456; y_correct = 1632899; assert(isequal(euler007(x),y_correct))

Test

Status

Code Input and Output

Pass

%% x = 6; y_correct = 13; assert(isequal(euler007(x),y_correct))

Pass

%% x = 10001; y_correct = 104743; assert(isequal(euler007(x),y_correct))

Pass

%% x = 123456; y_correct = 1632899; assert(isequal(euler007(x),y_correct))

Problem 241. Project Euler: Problem 7, Nth prime

Test Suite

Suggested Problems

More from this Author52

Problem 241. Project Euler: Problem 7, Nth prime

Test Suite

Suggested Problems

More from this Author52

Players