Sha256: 9172c25fd96fbf342cfa4a5938df45bfc62efccab19b9be6f94831a7389a7ce7
Contents?: true
Size: 872 Bytes
Versions: 71
Compression:
Stored size: 872 Bytes
Contents
# 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. ## Setup Go through the setup instructions for TypeScript to install the necessary dependencies: http://exercism.io/languages/typescript ## Requirements Install assignment dependencies: ```bash $ yarn install ``` ## Making the test suite pass Execute the tests with: ```bash $ yarn test ``` ## Source A variation on Problem 7 at Project Euler [http://projecteuler.net/problem=7](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.
Version data entries
71 entries across 71 versions & 1 rubygems