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 Solvers1567
Suggested Problems
-
Program an exclusive OR operation with logical operators
725 Solvers
-
Get the length of a given vector
11553 Solvers
-
Set the array elements whose value is 13 to 0
1377 Solvers
-
1726 Solvers
-
Find x rows where the sum of the numbers is the maximum
456 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!