1
exercism fetch groovy nth-prime

Nth Prime

Given a number n, determine what the nth prime is.

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.

For installation and learning resources, refer to the exercism help page.

Run the tests by executing the test script.

1
$ groovy ./NthPrimeSpec.groovy

After the first test(s) pass, continue by commenting out or removing the @Ignore annotations prepending other tests.

When all tests pass, congratulations!

Source

A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.