Problem 241. Project Euler: Problem 7, Nth prime
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
A good problem!
The constraints put on the solution such as not using if statements and not using nthprime should be stated in the problem. I had to look at the tests to work out the rules that the author wanted us to play to.
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.
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 Solvers1129
Back to basics 3 - Temp Directory
More from this Author51
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!