Sha256: de122c593e018d7ecd3c9d9d98e7e328b9e381288a4b1cfee601ac3a94f85806
Contents?: true
Size: 812 Bytes
Versions: 174
Compression:
Stored size: 812 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. Refer to the [Exercism CoffeScript page](http://exercism.io/languages/coffeescript) for getting started with CoffeeScript. In order to run the test, you can run the test file from the exercise directory: ```bash jasmine-node --coffee . ``` ## 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
174 entries across 174 versions & 1 rubygems