Problem 241. Project Euler: Problem 7, Nth prime
Solution Stats
Problem Comments
-
6 Comments
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 Solvers1573
Suggested Problems
-
3904 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5708 Solvers
-
Project Euler: Problem 3, Largest prime factor
1612 Solvers
-
453 Solvers
-
Return fibonacci sequence do not use loop and condition
696 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!