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.
Go through the setup instructions for TypeScript to install the necessary dependencies:
https://exercism.io/tracks/typescript/installation
Install assignment dependencies:
$ yarn installExecute the tests with:
$ yarn testIn the test suites all tests but the first have been skipped.
Once you get a test passing, you can enable the next one by changing xit to
it.
A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7
It's possible to submit an incomplete solution so you can see how others have completed the exercise.