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 this exercise the following C# feature comes in handy: Enumerables are evaluated lazily. They allow you to work with an infinite sequence of values. See this article.
Note: to help speedup calculation, you should not check numbers which you know beforehand will never be prime. For more information, see the Sieve of Eratosthenes.
To run the tests, run the command dotnet test from within the exercise directory.
Initially, only the first test will be enabled. This is to encourage you to solve the exercise one step at a time.
Once you get the first test passing, remove the Skip property from the next test and work on getting that test passing.
Once none of the tests are skipped and they are all passing, you can submit your solution
using exercism submit NthPrime.cs
For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io C# language page.
A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7