Problem 241. Project Euler: Problem 7, Nth prime
Solution Stats
Problem Comments
-
4 Comments
Aw drat. I was going to submit the n'th prime problem until I saw this.
Sadly, I see there are too few test cases, and the problem is too easy to cook.
why 'nthprime' not allowed?
There's a really easy way to cheese this problem if you find it. It happens to lie in the comment John D'Errico made about there being too few test cases. I'd encourage you to do the problem properly without such a cheese
Solution Comments
-
1 Comment
Another great problem!
-
1 Comment
This solution doesn't use any of the built-in MATLAB functions primes() or isprime(). It works for all integers N > 0, and requires only (N^0.75) iterations.
-
2 Comments
I do not know how the size are computed. Would someone please tell me?. Thanks in advance.
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.
Problem Recent Solvers954
Suggested Problems
-
1014 Solvers
-
Is my wife right? Now with even more wrong husband
1279 Solvers
-
MATCH THE STRINGS (2 CHAR) very easy
259 Solvers
-
475 Solvers
-
410 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!