# Nth Prime in Haskell

#### Given a number n, determine what the nth prime is.

1 | ```
exercism fetch haskell nth-prime
``` |

# 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.

## Getting Started

For installation and learning resources, refer to the exercism help page.

## Running the tests

To run the test suite, execute the following command:

1 |
```
stack test
``` |

#### If you get an error message like this...

1 |
```
No .cabal file found in directory
``` |

You are probably running an old stack version and need to upgrade it.

#### Otherwise, if you get an error message like this...

1 2 |
No compiler found, expected minor version match with... Try running "stack setup" to install the correct GHC... |

Just do as it says and it will download and install the correct compiler version:

1 |
```
stack setup
``` |

## Running *GHCi*

If you want to play with your solution in GHCi, just run the command:

1 |
```
stack ghci
``` |

## Feedback, Issues, Pull Requests

The exercism/haskell repository on GitHub is the home for all of the Haskell exercises.

If you have feedback about an exercise, or want to help implementing a new one, head over there and create an issue. We'll do our best to help you!

## Source

A variation on Problem 7 at Project Euler 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.