Sha256: a0313a2d52c941e757a40b55145e2816f0ae5913eeeb2b2f3ddacda97db4839a
Contents?: true
Size: 802 Bytes
Versions: 48
Compression:
Stored size: 802 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.
## Running the tests
Even though there are multiple implementations, we encourage to use Poly/ML.
```
$ poly -q < test_{ exercise }.sml
```
If you want to start an interactive session:
```
$ poly --use test_{ exercise }.sml
```
## 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
48 entries across 48 versions & 1 rubygems