Problem 241. Project Euler: Problem 7, Nth prime

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.