Sha256: c90716d41f434219d45cf8156c7eab582c1a90192853e742f9e2a6969305742f
Contents?: true
Size: 1.01 KB
Versions: 55
Compression:
Stored size: 1.01 KB
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 ECMAScript to install the necessary dependencies: http://exercism.io/languages/ecmascript/installation ## Requirements Install assignment dependencies: ```bash $ npm install ``` ## Making the test suite pass Execute the tests with: ```bash $ npm test ``` In 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 `xtest` to `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
55 entries across 55 versions & 1 rubygems