Problem 241. Project Euler: Problem 7, Nth prime
Solution Stats
Problem Comments
-
6 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
A good problem!
I'm really wondering about this cheese, as the problem is stupidly simple already. Even a proper solution is size 16. 25 if you really want to push huge numbers and use a proper upper bound on the nth prime.
Solution Comments
Show commentsProblem Recent Solvers1409
Suggested Problems
-
Sum all integers from 1 to 2^n
14822 Solvers
-
Back to basics 6 - Column Vector
1055 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
311 Solvers
-
632 Solvers
-
1752 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!